ANT: A novel heuristic algorithm for finding motif

Information Technology Journal

Volumn 6, Issue 2, 2007, Pages 189-195

  Tareeq, Saifuddin Md ^a   Saha, Sumanta ^a   Islam, Tohidul ^a   Quazi, Rumana ^a  

^a UNIVERSITY OF DHAKA   (Bangladesh)

Author keywords

DNA sequence; Gene; Motif

Indexed keywords

COMPUTATIONAL EFFICIENCY; COMPUTER SIMULATION; DNA SEQUENCES; GENES; MOLECULAR BIOLOGY;

BIOLOGICAL SEQUENCES; BIOSEQUENCE ANNOTATION; MOTIF DETECTION;

HEURISTIC ALGORITHMS;

EID: 34247227514     PISSN: 18125638     EISSN: 18125646     Source Type: Journal    
DOI: 10.3923/itj.2007.189.195     Document Type: Article

References (13)

1. Bailey, T.L. and C. Elkan, 1995. Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learn., 21: 51-80.
2. Blanchette, M., B. Schwikowski and M. Tompa, 2000. An exact algorithm to identify motifs in orthologous sequences from multiple species. In Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, San Diego, CA., pp: 37-45.
3. Brazma, A., I. Jonassen, J. Vilo and E. Ukkonen, 1998. Predicting Gene Regulatory Element In-silico on Genomic Scale. Genome Res., 15: 1202-1215.
4. Buhler, J. And M. Tompa, 2002. Finding Motif Using Random Projection. J. Comput. Biol., 9/2: 225-242.
5. Galas, D.J. M. Eggert and M. Watermann, 1985. Rigorous Pattern-recognition Methods for Dna Sequences: Analysis of Promoter Sequences from Escherichia Coli. J. Mol. Biol., 186/1: 117-128.
6. Herts, G.Z. and G.D. Storno, 1999. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics, 15: 563-577.
7. Lawrence, C.E. and A.A. Reilly, 1990. An Expectation Maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Protein: Struct. Func. Gene. 7: 41-51.
8. Lawrence, C.E., S.F. Altschul, M.S. Boguski, J.S. Liu, A.F. Newald and J.C. Wootton, 1993. Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignments. Science, 262: 208-214.
9. Neuwald, A.F. and P. Green, 1994. Detecting Patterns in Protein Sequences. J. Mol. Biol., 239/5: 698-712.
10. Pevzner, P. and S.J. Sze, 2000. Combinatorial approaches August 21, 2006to finding subtle signals in DNA sequences. In Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, San Diego, CA., pp: 268-278.
11. Rocke, E. and M. Tompa, 1998. An algorithm for finding novel gapped motif in DNA sequences. Proceedings of the 2nd Annual International Conference on Computational Molecular Biology, New York, pp: 228-233.
12. Tompa, M., 1999. An exact method for finding short motifs in sequences, with application to the ribosome binding sites. Seventh International Conference on Intelligent Systems for Molecular Biology, Heidelberg, Germany, pp: 262-271.
13. Workman, C. and G. Stormo, 2000. ANN-SPEC: A method for discovering transcription factor binding sites with improved specificity. In: Pacific Symposium of Biocomputing, 6: 464-476.