An algorithm with linear expected running time for string editing with substitutions and substring reversals.
Abdullah N. ArslanPublished in: Inf. Process. Lett. (2008)
Keyphrases
- linear complexity
- string matching
- improved algorithm
- dynamic programming
- detection algorithm
- theoretical analysis
- recognition algorithm
- cost function
- np hard
- computational cost
- times faster
- objective function
- closed form
- matching algorithm
- simulated annealing
- k means
- computationally efficient
- worst case
- suffix tree
- space efficient
- expectation maximization
- high accuracy
- probabilistic model
- convex hull
- preprocessing
- data streams
- learning algorithm