Longest repeated motif with a block of don't cares - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

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.
Fichier principal
Vignette du fichier
LATIN2004.pdf (3.47 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00619983 , version 1 (18-12-2015)

Identifiers

Cite

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⟩
240 View
114 Download

Altmetric

Share

Gmail Facebook X LinkedIn More