A subquadratic algorithm for minimum palindromic factorization.
Gabriele FiciTravis GagieJuha KärkkäinenDominik KempaPublished in: J. Discrete Algorithms (2014)
Keyphrases
- computational complexity
- detection algorithm
- computational cost
- learning algorithm
- recognition algorithm
- k means
- theoretical analysis
- improved algorithm
- experimental evaluation
- tree structure
- simulated annealing
- matching algorithm
- preprocessing
- dynamic programming
- probabilistic model
- cost function
- high accuracy
- significant improvement
- expectation maximization
- objective function
- convergence rate
- iterative algorithms
- worst case
- np hard
- evolutionary algorithm
- search space
- bayesian networks