Randomized algorithms for motif detection

Journal of Bioinformatics and Computational Biology

Volumn 3, Issue 5, 2005, Pages 1039-1052

  Wang, Lusheng ^a   Dong, Liang ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b PEKING UNIVERSITY   (China)

Author keywords

Candanized algorithm; Expectation maximization (EM) algorithm; Motif detection

Indexed keywords

ACCURACY; ARTICLE; COMPARATIVE STUDY; COMPUTER PROGRAM; COMPUTER SIMULATION; CONSENSUS SEQUENCE; DNA BINDING MOTIF; DNA DETERMINATION; DNA SEQUENCE; GENETIC ALGORITHM; GENETIC ANALYSIS; GENETIC DATABASE; HUMAN COMPUTER INTERACTION; INFORMATION RETRIEVAL; MATHEMATICAL COMPUTING; MATHEMATICAL MODEL; PROBABILITY; PROCESS OPTIMIZATION; SCORING SYSTEM;

ALGORITHMS; CONSERVED SEQUENCE; DATA INTERPRETATION, STATISTICAL; DNA; LIKELIHOOD FUNCTIONS; MODELS, GENETIC; MODELS, STATISTICAL; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SEQUENCE HOMOLOGY, NUCLEIC ACID;

EID: 28044451760     PISSN: 02197200     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219720005001508     Document Type: Article

References (17)

1. Bailey T, Elkan C, Unsupervised learning of multiple motifs in biopolymers using expectation maximization, Machine Learning 21:51-80, 1995.
2. Blanchette M, Algorithms for phylogenetic footprinting, RECOMB 01: Proc Fifth Annu Int Conf Comput Mol Biol, pp. 49-58, 2001.
3. Buhler J, Tompa M, Finding motifs using random projections, Journal of Comput Biol 9:225-242, 2002.
4. Dopazo J, Rodríguez A, Sáiz JC, Sobrino F, Design of primers for PCR amplification of highly variable genomes, CABIOS 9:123-125, 1993.
5. Duret L, Bucher P, Searching for regulatory elements in human noncoding sequences, Curr Opin Struct Biol 7:399-406, 1997.
6. Duret L, Dorkeld F, Gautier C, Strong conservation of non-coding sequences during vertebrates evolution: Potential involvement in post-transcriptional regulation of gene expression, Nucleic Acids Res 21:2315-2322, 1993.
7. Gusfield D, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, (Cambridge University Press) 1997.
8. Hertz G, Stormo G, Identification of consensus patterns in unaligned DNA and protein sequences: A large-deviation statistical basis for penalizing gaps, Proc. 3rd Int Conf Bioinformatics Genome Res, pp. 201-216, 1995.
9. Keich U, Pevzner P, Finding motifs in the twilight zone, Bioinformatics 18:1374-1381, 2002a.
10. Keich U, Pevzner P, Subtle motifs: Defining the limits of motif finding algorithms, Bioinformatics 18:1382-1390, 2002b.
11. Lanctot K, Li M, Ma B, et al. Distinguishing string selection problems, Proc. 10th ACM-SIAM Symp. Discrete Algorithms, pp. 633-642, 1999, to appear in Inf Comput.
12. Lawrence C, Reilly A, An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences, Proteins 7:41-51, 1990.
13. Li M, Ma B, Wang L, Finding similar regions in many sequences, J Comput Syst Sci 65:73-96, 2002.
14. Li M, Ma B, Wang L, On the closest string and substring problems, JACM 49(2):157-171, 2002.
15. Lucas K, Busch M, Mössinger S, Thompson JA, An improved microcomputer program for finding gene- or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probes, CABIOS 7:525-529, 1991.
16. Pevzner P, Sze S, Combinatorial approaches to finding subtle signals in DNA sequences, in Proc. 8th Int Conf Intelligent Syst Mol Biol, pp. 269-278, 2000.
17. Proutski V, Holme EC, Primer Master: A new program for the design and analysis of PCR primers, CABIOS 12:253-255, 1996.