Quasi-Linear-Time Algorithm for Longest Common Circular Factor.
Mai AlzamelMaxime CrochemoreCostas S. IliopoulosTomasz KociumakaJakub RadoszewskiWojciech RytterJuliusz StraszynskiTomasz WalenWiktor ZubaPublished in: CoRR (2019)
Keyphrases
- learning algorithm
- matching algorithm
- worst case
- computational complexity
- optimization algorithm
- preprocessing
- recognition algorithm
- search space
- np hard
- dynamic programming
- segmentation algorithm
- simulated annealing
- computationally efficient
- improved algorithm
- convergence rate
- tree structure
- space complexity
- objective function
- suffix array
- selection algorithm
- theoretical analysis
- estimation algorithm
- single pass
- memory requirements
- times faster
- clustering method
- expectation maximization
- probabilistic model
- k means
- artificial neural networks
- similarity measure
- image segmentation