Longest Motifs with a Functionally Equivalent Central Block - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

Longest Motifs with a Functionally Equivalent Central Block


This paper presents a generalization of the notion of longest repeats with a block of k don't care symbols introduced by [Crochemore et al., LATIN 2004] (for k fixed) to longest motifs composed of three parts: a first and last that parameterize match (that is, match via some symbol renaming, initially unknown), and a functionally equivalent central block. Such three-part motifs are called longest block motifs. Different types of functional equivalence, and thus of matching criteria for the central block are considered, which include as a subcase the one treated in [Crochemore et al., LATIN 2004] and extend to the case of regular expressions with no Kleene closure or complement operation. We show that a single general algorithmic tool that is a non-trivial extension of the ideas introduced in [Crochemore et al., LATIN 2004] can handle all the various kinds of longest block motifs defined in this paper. The algorithm complexity is, in all cases, in O(n log n).
Fichier principal
Vignette du fichier
2004_01.pdf (151.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00619978 , version 1 (15-07-2013)



Maxime Crochemore, Raffaele Giancarlo, Marie-France Sagot. Longest Motifs with a Functionally Equivalent Central Block. SPIRE'2004, Oct 2004, Padova, Italy. pp.298-309, ⟨10.1007/978-3-540-30213-1_42⟩. ⟨hal-00619978⟩
281 View
215 Download



Gmail Facebook X LinkedIn More