A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications.
Laurent BulteauGuillaume FertinChristian KomusiewiczIrena RusuPublished in: WABI (2013)
Keyphrases
- k means
- computational cost
- learning algorithm
- computational complexity
- dynamic programming
- cost function
- square error
- recognition algorithm
- worst case
- search space
- significant improvement
- preprocessing
- string matching
- optimal solution
- probabilistic model
- computationally efficient
- detection algorithm
- neural network
- suffix tree
- improved algorithm
- feature selection
- convergence rate
- particle swarm optimization
- objective function
- experimental evaluation
- np hard