Skip Navigation



Bioinformatics Advance Access published online on July 26, 2006
Bioinformatics, doi:10.1093/bioinformatics/btl371
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
22/18/2217    most recent
btl371v1
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 Leung, H. C. M.
Right arrow Articles by Chin, F. Y. L.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Leung, H. C. M.
Right arrow Articles by Chin, F. Y. L.
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 April 11, 2006
Revised June 12, 2006
Accepted July 4, 2006

Article

Finding motifs from all sequences with and without binding sites*

Henry C. M. Leung 1 * and Francis Y. L. Chin 1

1 Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong

* To whom correspondence should be addressed.
Henry C. M. Leung, E-mail: cmleung2{at}cs.hku.hk


  Abstract

Motivation: Finding common patterns, motifs, from a set of promoter regions of coregulated genes is an important problem in molecular biology. Most existing motif-finding algorithms consider a set of sequences bound by the transcription factor as the only input. However, we can get better results by considering sequences that are not bound by the transcription factor as an additional input.

Results: Firstly, instead of using the simple hyper-geometric analysis, we propose to calculate the likelihood based on a more precise probabilistic analysis which considers motif length, sequence length and number of binding sites as input parameters for testing whether motif is found. Secondly, we adopt an heuristic algorithm bases on our analysis to find motifs. For the simulated and real data sets, our algorithm ALSE compares favorably against common motif-finding programs such as SeedSearch and MEME in all cases and performs very well, especially when each input sequence contains more than one binding site.

Availability: ALSE is available for download at the homepage http://alse.cs.hku.hk.

Associate Editor: Nikolaus Rajewsky

*This research was supported in parts by the Hong Kong RGC grant HKU 7135/04E


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.