Suffix tree characterization of maximal motifs in biological sequences

Communications in Computer and Information Science

Volumn 13, Issue , 2008, Pages 456-465

  Federico, Maria ^a   Pisanti, Nadia ^b  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Biological sequences; Maximal motifs; Suffix trees

Indexed keywords

APPROXIMATION ALGORITHMS; BIRDS; FORESTRY; TREES (MATHEMATICS);

BIOLOGICAL SEQUENCES; INPUT SIZE; MAXIMAL MOTIFS; MAXIMALITY; ON THE FLIES; STRING ALGORITHMS; SUFFIX TREE DATA STRUCTURES; SUFFIX-TREES;

BIOINFORMATICS;

EID: 80052710996     PISSN: 18650929     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-70600-7_35     Document Type: Article

References (12)

1. Carvalho, A.M., Freitas, A.T., Oliveira, A.L., Sagot, M.-F.: An efficient algorithm for the identification of structured motifs in dna promoter sequences. IEEE/ACM Trans. Comput. Biology Bioinform. 3(2), 126-140 (2006)
2. Tompa, M., et al.: Assessing computational tools for the discovery of transcription factor binding sites. Nature Biotechnology 23(1), 137-144 (2005)
3. Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York (1997)
4. Kolpakov, R.M., Kucherov, G.: Finding approximate repetitions under hamming distance. In: ESA, pp. 170-181 (2001)
5. Kurtz, S., Ohlebusch, E., Schleiermacher, C., Stoye, J., Giegerich, R.: Computation and visualization of degenerate repeats in complete genomes. In: ISMB, pp. 228-238 (2000)
6. Marsan, L., Sagot, M.-F.: Algorithms for extracting structured motifs using a suffix tree with application to promoter and regulatory consensus identification. J. Comp. Bio. 7, 345-360 (2001)
7. McCreight, E.: A space-economical suffix tree construction algorithm. J. ACM 23(2), 262-272 (1976)
8. Pavesi, G., Mereghetti, P., Mauri, G., Pesole, G.: Weeder web: discovery of transcription factor binding sites in a set of sequences from co-regulated genes. Nucleic Acids Research 32, 199-203 (2004)
9. Sagot, M.-F.: Spelling approximate repeated or common motifs using a suffix tree. In: LATIN, pp. 374-390 (1998)
10. Ukkonen, E.:On-line construction of suffix trees. Algorithmica 14(3), 249-260 (1995)
11. Ukkonen, E.: Structural analysis of gapped motifs of a string. In: MFCS, pp. 681-690 (2007)
12. Vanet, A., Marsan, L., Labigne, A., 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. J. of Mol. Biol. 297, 335-353 (2000)