Journal
THEORETICAL COMPUTER SCIENCE
Volume 525, Issue -, Pages 89-102Publisher
ELSEVIER
DOI: 10.1016/j.tcs.2013.08.012
Keywords
Motifs; Tandem; Patterns; Irredundant; Redundant motifs; String algorithm; Suffix tree
Categories
Funding
- Progetto di Ateneo dell'Universita di Padova [CPDA110239]
- Italian Ministry for Education, University and Research [PON 01 02477 2007-2013 - FRAME]
- Italian Ministry for Education, University and Research under grant FIT (IDEAS: Un Ambiente Integrato per lo Sviluppo di Applicazioni e Soluzioni)
Ask authors/readers for more resources
Eliminating the possible redundancy from a set of candidate motifs occurring in an input string is fundamental in many applications. The existing techniques proposed to extract irredundant motifs are not suitable when the motifs to search for are structured, i.e., they are made of two (or several) subwords that co-occur in a text string s of length n. The main effort of this work is studying and characterizing a compact class of tandem motifs, that is, pairs of substrings < m(1), m(2)> occurring in tandem within a maximum distance of d symbols in s, where d is an integer constant given in input. To this aim, we first introduce the concept of maximality, related to four specific conditions that hold only for this class of motifs. Then, we eliminate the remaining redundancy by defining the notion of irredundancy for tandem motifs. We prove that the number of non-overlapping irredundant tandem motifs is O(d(2)n) which, considering d as a constant, leads to a linear number of tandems in the length of the input string. This is an order of magnitude less than previously developed compact indexes for tandem extraction. The notions and bounds provided for tandem motifs are generalized for the case r >= 2, if r is the number of subwords composing the motifs. Finally, we also provide an algorithm to extract irredundant tandem motifs. (C) 2013 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available