Suffix tree characterization of maximal motifs in biological sequences

Theoretical Computer Science

Volumn 410, Issue 43, 2009, Pages 4391-4401

  Federico, Maria ^a   Pisanti, Nadia ^b  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Maximal motifs; Motif discovery; Suffix tree

Indexed keywords

APPROXIMATION DEGREES; BIOLOGICAL SEQUENCES; COMPUTATIONAL PROBLEM; INPUT SIZE; MAXIMAL MOTIFS; MAXIMALITY; MOTIF DISCOVERY; STRING ALGORITHMS; SUFFIX TREE; SUFFIX-TREES;

BIOCHEMISTRY; DATA STRUCTURES; MOLECULAR BIOLOGY; QUALITY ASSURANCE; REDUNDANCY;

HAMMING DISTANCE;

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

References (22)

1. Apostolico A., and Parida L. Incremental paradigms of motif discovery. Journal of Computational Biology 11 (2004) 15-25
2. A.M. Carvalho, A.T. Freitas, A.L. Oliveira, M.-F. Sagot, Efficient extraction of structured motifs using box-links, in: Proceedings of the 11th Symposium on String Processing and Information Retrieval, SPIRE, vol. 3246, 2004, pp. 267-268
3. Carvalho A.M., Freitas A.T., Oliveira A.L., and Sagot M.-F. A highly scalable algorithm for the extraction of cis-regulatory regions. Proceedings of the 3rd Asia-Pacific Bioinformatics Conference APBC (2005), Imperial College Press 273-282
4. Carvalho A.M., Freitas A.T., Oliveira A.L., and Sagot M.-F. An efficient algorithm for the identification of structured motifs in dna promoter sequences. IEEE/ACM Transaction on Computational Biology and Bioinformatics 3 2 (2006) 126-140
5. Tompa M., et al. Assessing computational tools for the discovery of transcription factor binding sites. Nature Biotechnology 23 1 (2005) 137-144
6. Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology (1997), Cambridge University Press, New York, NY, USA
7. L.C.K. Hui, Color set size problem with application to string matching, in: Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching, CPM, 1992, pp. 230-243
8. R.M. Kolpakov, G. Kucherov, Finding approximate repetitions under hamming distance, in: Proceedings of the 9th Annual European Symposium on Algorithms, ESA, 2001, pp. 170-181
9. S. Kurtz, E. Ohlebusch, C. Schleiermacher, J. Stoye, R. Giegerich, Computation and visualization of degenerate repeats in complete genomes, in: Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, ISMB, 2000, pp. 228-238
10. L. Marsan, M.-F. Sagot, Extracting structured motifs using a suffix tree, Algorithms and application to promoter consensus identification, in: Annual Conference on REsearch in COmputational Molecular Biology, RECOMB, 2000
11. Marsan L., and Sagot M.-F. Algorithms for extracting structured motifs using a suffix tree with application to promoter and regulatory consensus identification. Journal of Computational Biology 7 (2001) 345-360
12. McCreight E.M. A space-economical suffix tree construction algorithm. Journal of the ACM 23( 2 (1976) 262-272
13. 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: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2000
14. Pavesi G., Mereghetti P., Mauri G., and Pesole G. Weeder web: Discovery of transcription factor binding sites in a set of sequences from co-regulated genes. Nucleic Acids Research 32 Web-Server-Issue (2004) 199-203
15. N. Pisanti, A.M. Carvalho, L. Marsan, M.-F. Sagot, Risotto: Fast extraction of motifs with mismatches, in: Proceedings of the 7th Latin American Symposium on Theoretical Informatics, LATIN, 2006, pp. 757-768
16. M.-F. Sagot, Spelling approximate repeated or common motifs using a suffix tree, in: Proceedings of the 3rd Latin American Symposium on Theoretical Informatics, LATIN, 1998, pp. 374-390
17. Soldano H., Viari A., and Champesme M. Searching for flexible repeated patterns using a non-transitive similarity relation. Pattern Recognition Letters 16 (1995) 243-246
18. Ukkonen E. On-line construction of suffix trees. Algorithmica 14 3 (1995) 249-260
19. E. Ukkonen, Structural analysis of gapped motifs of a string, in: Proceedings of the Mathematical Foundations of Computer Science, MFCS, 2007, pp. 681-690
20. Vanet A., Marsan L., Labigne A., and Sagot M.-F. Inferring regulatory elements from a whole genome. An application to the analysis of the genome of helicobacter pylori sigma 80 family of promoter signals. Journal of Molecular Biology 297 (2000) 335-353
21. Vanet A., Marsan L., and Sagot M.-F. Promoter sequences and algorithmical methods for identifying them. Research in Microbiology 150 1 (1999) 1-21
22. P. Weiner, Linear pattern matching algorithms, in: Proceedings of the 14th IEEE Symposium on Switching and Automata Theory (former name of Foundations of Computer Science, FOCS), 1973, pp. 1-11