A parallel algorithm for the extraction of structured motifs

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2004, Pages 147-153

  Carvalho, Alexandra M ^a   Oliveira, Arlindo L ^a   Freitas, Ana T ^a   Sagot, Marie France ^b,c  

^a INESC ID   (Portugal)

^b UNIVERSITÉ LYON 1   (France)

^c KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Bioinformatics; Grid computing; Parallel algorithm; Structured motifs; Suffix tree

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DNA; GENES; PARALLEL ALGORITHMS; PARAMETER ESTIMATION; PROBLEM SOLVING; STORAGE ALLOCATION (COMPUTER);

BIOINFORMATICS; GRID COMPUTING; STRUCTURED MOTIFS; SUFFIX TREE;

GENETIC ENGINEERING;

EID: 2442493152     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/967900.967932     Document Type: Conference Paper

References (19)

1. A. Apostolico, C. Iliopoulis, G. Landau, B. Schieber, and U. Vishkin. Parallel construction of a suffix tree with applications. Algorithmica, 3:347-365, 1988.
2. A. Brazma, I. Jonassen, J. Vilo, and E. Ukkonen. Prediction gene regulatory elements in silica on a genomic scale. Genome Research, 8:1202-1215, 1998.
3. L. Cardon and G. Stormo. Expectation Maximization algorithm for identifying protein-binding sites with variable length from unaligned dna fragments, Journal of Molecular Biology, 223:139-170, 1992.
4. T. Cormen, C. Leiserson, and R. Rivest. Introduction to algorithms. MIT Press, 1990.
5. Y. Praenkel, Y. Mandel, D. Friedberg, and H. Margalit. Identification of common motifs in unaligned dna sequences: application to escherichia coli lpr regulon. Computer Applications in Biosciences, 11:379-387, 1995.
6. M. Garey and D. Johnson, Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, 1979.
7. D. Gusfield. Algorithms on strings, trees, and sequences. Cambridge University Press, 1997.
8. R. Hariharan. Optimal parallel suffix tree construction. Journal of Computer and Systems Sciences, 55(1):44-69, 1997.
9. E. Hunt, M. Atkinson, and R. Irving. A database index to large biological sequences. In Proceedings of the 27th International Conference on Very Large Databases (VLDB 2001), pages 139-148, 2001.
10. A. Klingenhoff, K. Frech, K. Quandt, and T. Werner. Functional promoter model can be detected by formal models independent of overall nucleotide sequences similarity. Bioinformatics, 1(15):180-186, 1999.
11. L. Marsan and M.-F. Sagot. Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. Journal of Computational Biology, 7:345-360, 2000.
12. E. McCreight. A space economical suffix tree construction algorithm. Journal of the ACM, 23:262-272, 1976.
13. M.-F. Sagot. Spelling approximate repeated or common motifs using a suffix tree. In Latin'98, volume 1380 of Lecture Notes in Computer Science, pages 111-127. Spriger-Verlag, 1998.
14. K.-B. Schürmann and J. Stoye. Suffix tree construction for large strings. Technical report, Freie Universität Berlin, 2002.
15. M. Tompa. An exact method for finding short motifs in sequences, with application to the ribosome binding site problem. In A. Press, editor, Proceedings of the 7th International Symposium on Intelligent Systems for Molecular Biology, pages 262-271, 1999.
16. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14:249-260, 1995.
17. J. van Helden, B. André, and J. Collado-Vides. Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. Journal of Molecular Biology, 281:827-842, 1998.
18. J. van Helden, A. Rios, and J. Collado-Vides. Discovering regulatory elements in non-coding sequences by analysis of spaced dyads. Nucleic Acids Research, 28:1808-1818, 2000.
19. P. Weiner. Linear pattern matching algorithms. In Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.