A survey of DNA motif finding algorithms

被引:287
作者
Das, Modan K. [1 ,2 ]
Dai, Ho-Kwok [1 ]
机构
[1] Oklahoma State Univ, Dept Comp Sci, Stillwater, OK 74078 USA
[2] Univ Arizona, USDA ARS, Dept Plant Sci, Tucson, AZ 85721 USA
关键词
Transcription Factor Binding Site; Motif Finding; Motif Model; Orthologous Sequence; Suffix Tree;
D O I
10.1186/1471-2105-8-S7-S21
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Background: Unraveling the mechanisms that regulate gene expression is a major challenge in biology. An important task in this challenge is to identify regulatory elements, especially the binding sites in deoxyribonucleic acid (DNA) for transcription factors. These binding sites are short DNA segments that are called motifs. Recent advances in genome sequence availability and in high-throughput gene expression analysis technologies have allowed for the development of computational methods for motif finding. As a result, a large number of motif finding algorithms have been implemented and applied to various motif models over the past decade. This survey reviews the latest developments in DNA motif finding algorithms. Results: Earlier algorithms use promoter sequences of coregulated genes from single genome and search for statistically overrepresented motifs. Recent algorithms are designed to use phylogenetic footprinting or orthologous sequences and also an integrated approach where promoter sequences of coregulated genes and phylogenetic footprinting are used. All the algorithms studied have been reported to correctly detect the motifs that have been previously detected by laboratory experimental approaches, and some algorithms were able to find novel motifs. However, most of these motif finding algorithms have been shown to work successfully in yeast and other lower organisms, but perform significantly worse in higher organisms. Conclusion: Despite considerable efforts to date, DNA motif finding remains a complex challenge for biologists and computer scientists. Researchers have taken many different approaches in developing motif discovery tools and the progress made in this area of research is very encouraging. Performance comparison of different motif finding tools and identification of the best tools have proven to be a difficult task because tools are designed based on algorithms and motif models that are diverse and complex and our incomplete understanding of the biology of regulatory mechanism does not always provide adequate evaluation of underlying algorithms over motif models.
引用
收藏
页数:13
相关论文
共 92 条
[1]   Environmentally induced foregut remodeling by PHA-4/FoxA and DAF-12/NHR [J].
Ao, W ;
Gaudet, J ;
Kent, WJ ;
Muttumu, S ;
Mango, SE .
SCIENCE, 2004, 305 (5691) :1743-1746
[2]   Efficient detection of unusual words [J].
Apostolico, A ;
Bock, ME ;
Lonardi, S ;
Xu, XY .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2000, 7 (1-2) :71-94
[3]  
BAILEY TL, 1995, MACH LEARN, V21, P51, DOI 10.1007/BF00993379
[4]  
Berezikov E, 2004, GENOME RES, V14, P170
[5]   Discovery of regulatory elements by a computational method for phylogenetic footprinting [J].
Blanchette, M ;
Tompa, M .
GENOME RESEARCH, 2002, 12 (05) :739-748
[6]   AVID: A global alignment program [J].
Bray, N ;
Dubchak, I ;
Pachter, L .
GENOME RESEARCH, 2003, 13 (01) :97-102
[7]   Predicting gene regulatory elements in silico on a genomic scale [J].
Brazma, A ;
Jonassen, I ;
Vilo, J ;
Ukkonen, E .
GENOME RESEARCH, 1998, 8 (11) :1202-1215
[8]   LAGAN and Multi-LAGAN: Efficient tools for large-scale multiple alignment of genomic DNA [J].
Brudno, M ;
Do, CB ;
Cooper, GM ;
Kim, MF ;
Davydov, E ;
Green, ED ;
Sidow, A ;
Batzoglou, S .
GENOME RESEARCH, 2003, 13 (04) :721-731
[9]   WEIGHT MATRIX DESCRIPTIONS OF 4 EUKARYOTIC RNA POLYMERASE-II PROMOTER ELEMENTS DERIVED FROM 502 UNRELATED PROMOTER SEQUENCES [J].
BUCHER, P .
JOURNAL OF MOLECULAR BIOLOGY, 1990, 212 (04) :563-578
[10]   Finding motifs using random projections [J].
Buhler, J ;
Tompa, M .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2002, 9 (02) :225-242