Longest repeated motif with a block of don't cares

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.
Document type :
Conference papers
Complete list of metadatas

https://hal-upec-upem.archives-ouvertes.fr/hal-00619983
Contributor : Maxime Crochemore <>
Submitted on : Friday, December 18, 2015 - 9:32:47 AM
Last modification on : Thursday, April 18, 2019 - 2:43:26 PM
Long-term archiving on : Saturday, March 19, 2016 - 11:40:40 AM

File

LATIN2004.pdf
Files produced by the author(s)

Identifiers

Citation

Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot. Longest repeated motif with a block of don't cares. 6th Latin American Theoretical Informatics (LATIN'04), 2004, Buenos Aires, Argentina. pp.271-278, ⟨10.1007/978-3-540-24698-5_31⟩. ⟨hal-00619983⟩

Share

Metrics

Record views

385

Files downloads

79