Skip Navigation



Bioinformatics Advance Access published online on February 2, 2006
Bioinformatics, doi:10.1093/bioinformatics/btl037
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow Supplementary Data
Right arrow All Versions of this Article:
22/9/1047    most recent
btl037v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Hon, L. S.
Right arrow Articles by Jain, A. N.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Hon, L. S.
Right arrow Articles by Jain, A. N.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2006). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org
Received October 14, 2005
Revised December 1, 2005
Accepted February 1, 2006

Article

A deterministic motif finding algorithm with application to the human genome

Lawrence S. Hon 1 and Ajay N. Jain 1 *

1 UCSF Cancer Research Institute and Comprehensive Cancer Center, University of California, San Francisco

* To whom correspondence should be addressed.
Ajay N. Jain, E-mail: ajain{at}jainlab.org


  Abstract

Motivation: We present a novel algorithm, MaMF, for identifying transcription factor (TF) binding site motifs. The method is deterministic and depends on an indexing technique to optimize the search process. On common yeast data sets, MaMF performs competitively with other methods. We also present results on a challenging group of eight sets of human genes known to be responsive to a diverse group of TFs. In every case, MaMF finds the annotated motif among the top scoring putative motifs. We compared MaMF against other motif finders on a larger human group of 21 gene sets and found that MaMF performs better than other algorithms. We analyzed the remaining high scoring motifs and show that many correspond to other TFs that are known to co-occur with the annotated TF motifs. The significant and frequent presence of co-occurring transcription factor binding sites explains in part the difficulty of human motif finding. MaMF is a very fast algorithm, suitable for application to large numbers of interesting gene sets.

Availability: The software is available for academic research use free of charge by email request.

Supplemental Information: Data comprising the benchmarks used in the paper may be downloaded from http://www.jainlab.org/downloads.html.

Associate Editor: Nikolaus Rajewsky
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.