Algorithms for challenging motif problems

Journal of Bioinformatics and Computational Biology

Volumn 4, Issue 1, 2006, Pages 43-58

  Leung, Henry C M ^a   Chin, Francis Y L ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Binding sites; DNA sequences; Gene regulation; Motifs discovering; Pattern recognition; Transcription factor

Indexed keywords

NUCLEOTIDE; TRANSCRIPTION FACTOR;

ALGORITHM; ARTICLE; CONTROLLED STUDY; DATA ANALYSIS; EXPERIMENTATION; MATHEMATICAL ANALYSIS; NUCLEOTIDE SEQUENCE; PROBABILITY; PROTEIN MOTIF; PROTEIN STRUCTURE; RANDOMIZATION; SEQUENCE ANALYSIS; SIMULATION; THEORETICAL STUDY;

ALGORITHMS; BINDING SITES; COMPUTATIONAL BIOLOGY; DNA; PROMOTER REGIONS (GENETICS); TRANSCRIPTION FACTORS;

EID: 33645308223     PISSN: 02197200     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219720006001692     Document Type: Article

References (26)

1. Bailey T, Elkan C, Unsupervised learning of multiple motifs in biopolymers using expectation maximization, Machine Learning 21:51-80, 1995.
2. Brazma A, Jonassen I, Eidhammer I, Gilbert D, Approaches to the automatic discovery of patterns in biosequences, J Computational Biol 5:279-305, 1998.
3. Buhler J, Tompa M, Finding motifs using random projections, J Computational Biol 9(2):225-242, 2002.
4. Chiba N, Nishizeki T, Arboricity and subgraph listing algorithm, SIAM J Comput 14:210-223, 1985.
5. Chin F, Leung H, Yiu SM et al., Finding motifs with insufficient number of strong binding sites, J Computational Biol, 2005, to appear.
6. Chin F, Leung H, Yiu SM et al., Finding motifs for insufficient number of sequences with strong binding to transcription factor, RECOMB04, pp. 125-132, 2004.
7. Fraenkel Y, Mandel Y, Friedberg D, Margalit H, Identification of common motifs in unaligned DNA sequences: Application to Escherichia coli Lrp regulon, Bioinformatics 11:379-387, 1995.
8. Gelfand M, Koonin E, Mironov A, Prediction of transcription regulatory sites in archaea by a comparative genomic approach, Nucleic Acids Res 28:695-705, 2000.
9. van Helden J, Andre B, Vides JC, Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies, J Mol Biol 281(5):827-842, 1998.
10. Hertz GZ, Stormo GD, Identification of consensus patterns in unaligned DNA and protein sequences: A large-deviation statistical basis for penalizing gaps, The 3rd Int Conf Bioinformatics Genome Research, pp. 201-216, 1995.
11. Lawrence C, Altschul S, Boguski M et al., Detecting subtule sequence signals: A Gibbs sampling strategy for multiple alignment, Science 262:208-214, 1993.
12. Lawrence C, Reilly A, An expectation maximization (em) for the identification and characterization of common sites in unaligned biopolymer sequences, Proteins: Struct Func Genet 7:41-51, 1990.
13. Leung H, Chin F, Finding exact optimal motif in matrix representation by partitioning, European Conf Computational Biol, 2005, to appear.
14. Leung H, Chin F, Generalized planted (l, d)-motif problem with negative set, Workshop Algorithms Bioinformatics, 2005, to appear.
15. Li M, Ma B, Wang L, Finding similar regions in many strings, J Computer System Sci 65:73-96, 2002.
16. Liang S, cWINNOWER algorithm for finding fuzzy DNA motifs, Computer Society Bioinformatics Conf, pp. 260-265, 2003.
17. Marsan L, Sagot MF, Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification, J Computerational Biol 7(3-4):345-362, 2000.
18. Pesole G, Prunella N, Liuni S et al., Wordup: An efficient algorithm for discovering statistically significant patterns in DNA sequences, Nucleic Acids Res 20(11): 2871-2875, 1992.
19. Pevzner P, Sze SH, Combinatorial approaches to finding subtle signals in DNA sequences, Proc. Eighth Int Conf Intelligent Systems Mol Biol, pp. 269-278, 2000.
20. Sagot MF, Spelling approximate repeated or common motifs using a suffix tree, in Lucchesi CL, Moura AV (eds), Latin'98: Theoretical Informatics, Vol. 1380 Lecture Notes Computer Sci, pp. 111-127, 1998.
21. Sagot MF, A Highly scalable algorithm for the extraction of cis-regulatory regions, Proc. 3rd Asia-Pacific Bioinformatic Conf, pp. 271-282, 2005.
22. Staden R, Methods for discovering novel motifs in nucleic acid sequences, Computer Applications Biosciences 5(4):293-298, 1989.
23. Tompa M, An exact method for finding short motifs in sequences with application to the ribosome binding site problem, Proc 7th Int Conf Intelligent Systems Mol Biol, pp. 262-271, 1999.
24. Waterman MS, Arratia R, Galas DJ, Pattern recognition in several sequences: Consensus and alignment, Bull Math Biol 46:515-527, 1984.
25. Wolfertsteeter F, Frech K, Herrmann G, Wernet T, Identification of functional elements in unaligned nucleic acid sequences by a novel tuple search algorithm, Computer Applications Biosciences 12(1):71-80, 1996.
26. Zhu J, Zhang M, SCPD: A promoter database of the yeast Saccha-romyces cerevisiae, Bioinformatics 15:563-577, 1999.