DocumentCode
392437
Title
Performance comparison of algorithms for finding transcription factor binding sites
Author
Sinha, Saurabh ; Tompa, Martin
Author_Institution
Dept. of Comput. Sci. & Eng., Univ. of Washington, Seattle, WA, USA
fYear
2003
fDate
10-12 March 2003
Firstpage
214
Lastpage
220
Abstract
We compare the accuracy of three motif-finding algorithms for the discovery of novel transcription factor binding sites among co-regulated genes. One of the algorithms (YMF) uses a motif model tailored for binding sites and an enumerative search of the motif space, while the other two (MEME and AlignACE) use a more general motif model and local search techniques. The comparison is done on synthetic data with planted motifs, as well as on real data sets of co-regulated genes from the yeast S. cerevisiae. More often than not, the enumerative algorithm is found to be more accurate than the other two on the yeast data sets, though there is a noticeable exclusivity in the accuracy of the different algorithms. The experiments on synthetic data reveal, not surprisingly, that each algorithm outperforms the others when motifs are planted according to its motif model.
Keywords
genetics; microorganisms; physiological models; algorithms accuracy; algorithms performance comparison; co-regulated genes; enumerative algorithm; planted motifs; synthetic data; transcription factor binding sites finding; yeast S. cerevisiae; Fungi;
fLanguage
English
Publisher
ieee
Conference_Titel
Bioinformatics and Bioengineering, 2003. Proceedings. Third IEEE Symposium on
Print_ISBN
0-7695-1907-5
Type
conf
DOI
10.1109/BIBE.2003.1188949
Filename
1188949
Link To Document