Maximal and minimal representations of gapped and non-gapped motifs of a string

Theoretical Computer Science

Volumn 410, Issue 43, 2009, Pages 4341-4349

  Ukkonen, Esko ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

Gap symbol; Maximal motif; Minimal motif; Motif discovery algorithm; NP completeness; Pattern; Sequence motif

Indexed keywords

GAP SYMBOL; MAXIMAL MOTIF; MINIMAL MOTIF; MOTIF DISCOVERY ALGORITHM; NP-COMPLETENESS; PATTERN; SEQUENCE MOTIF;

CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY; SET THEORY;

EQUIVALENCE CLASSES;

EID: 67649640546     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.07.015     Document Type: Article

References (14)

1. Apostolico A., Bock M.E., and Lonardi S. Monotony of surprise and large-scale quest for unusual words. Proc. RECOMB 2002 (2002), ACM Press 22-31
2. Apostolico A., and Parida L. Incremental paradigms of motif discovery. J. Comput. Biol. 11 (2004) 15-25
3. Arimura H., and Uno T. A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. Proc. ISAAC 2005. LNCS vol. 3827 (2005), Springer 724-737
4. Crochemore M., Iliopoulos C.S., Mohamed M., and Sagot M.-F. Longest repeats with a block of k don't cares. Theoret. Comput. Sci. 362 (2006) 248-254
5. Crochemore M., and Rytter W. Jewels of Stringology (2002), World Scientific
6. Federico M., and Pisanti N. Suffix tree characterization of maximal motifs in biological sequences. Proc. BIRD 2008. CCIS 13 (2008), Springer 456-465
7. Fischer M.J., and Paterson M.S. String matching and other products. Complexity of Computation (1974), SIAM-AMS Proc 113-125
8. Gusfield D. Algorithms on Strings, Trees, and Sequences (1997), Cambridge University Press
9. M. Michael, F. Nicolas, E. Ukkonen, On the complexity of finding gapped motifs, Submitted manuscript 2007
10. L. Parida, I. Rigoutsos, A. Floratos, D. Platt, Y. Gao, Pattern discovery on character sets and real-valued data: Linear bound on irredundant motifs and efficient polynomial time algorithm, in: Proc. 11th SIAM Symposium on Discrete algorithms, SODA'00, 2000, pp. 297-308
11. Parida L., Rigoutsos I., and Platt D.E. An output-sensitive flexible pattern discovery algorithm. Proc. CPM 2001. LNCS vol. 2089 (2001), Springer 131-142
12. Pelfrêne J., Abdeddaïm S., and Alexandre J. Extracting approximate patterns. J. Discrete Algorithms 3 (2005) 293-320
13. Pisanti N., Crochemore M., Grossi R., and Sagot M.-F. A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum. Proc. MFCS 2003. LNCS vol. 2747 (2003), Springer 622-631
14. Pisanti N., Crochemore M., Grossi R., and Sagot M.-F. Bases of motifs for generating repeated patterns with wild cards. IEEE/ACM Trans. Comput. Biol. Bioinform. 2 (2005) 40-50