Linear Time Algorithms for Generalizations of the Longest Common Substring Problem.
Michael ArnoldEnno OhlebuschPublished in: Algorithmica (2011)
Keyphrases
- suffix array
- data structure
- worst case
- computational complexity
- theoretical analysis
- space complexity
- computational cost
- recently developed
- computational efficiency
- optimization problems
- sequence analysis
- graph theory
- orders of magnitude
- data mining techniques
- learning algorithm
- search space
- face recognition
- information systems
- computer vision