Abstract
We introduce an algorithm for extracting all longest repeats with k don't cares from a given sequence. Such repeats are composed of two parts separated by a block of k don't care symbols. The algorithm uses suffix trees to fulfill this task and relies on the ability to answer the lowest common ancestor queries in constant time. It requires O(n log n) time in the worst-case. © Springer-Verlag 2004.
Author supplied keywords
Cite
CITATION STYLE
Crochemore, M., Iliopoulos, C. S., Mohamed, M., & Sagot, M. F. (2004). Longest repeats with a block of don’t cares. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2976, 271–278. https://doi.org/10.1007/978-3-540-24698-5_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
