Skip Navigation

Bioinformatics 2005 21(Suppl 1):i311-i318; doi:10.1093/bioinformatics/bti1044
This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow A correction has been published
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 Nagarajan, N.
Right arrow Articles by Keich, U.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Nagarajan, N.
Right arrow Articles by Keich, U.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions{at}oupjournals.org

Computing the P-value of the information content from an alignment of multiple sequences

Niranjan Nagarajan 1, Neil Jones 2 and Uri Keich 1,*

1Computer Science Department 4130 Upson Hall Cornell University Ithaca, NY 14853, USA
2Department of Computer Science and Engineering, University of California San Diego, 9500 Gilman Drive, La Jolla, CA 92093, USA

*To whom correspondence should be addressed.

Motivation: The efficient and accurate computation of P-values is an essential requirement for motif-finding and alignment tools. We show that the approximation algorithms used in two popular motif-finding programs, MEME and Consensus, can fail to accurately compute the P-value.

Results: We present two new algorithms: one for the evaluation of the P-values of a range of motif scores, and a faster one for the evaluation of the P-value of a single motif score. Both exhibit more reliability than existing algorithms, and the latter algorithm is comparable in speed to the fastest existing method.

Availability: The algorithms described in this paper are available from http://www.cs.cornell.edu/~keich

Contact: keich{at}cs.cornell.edu

Received on January 15, 2005; accepted on March 27, 2005

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Nucleic Acids ResHome page
G. Li, B. Liu, and Y. Xu
Accurate recognition of cis-regulatory motifs with the correct lengths in prokaryotic genomes
Nucleic Acids Res., November 11, 2009; (2009) gkp907v1.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
N. Nagarajan and U. Keich
FAST: Fourier transform based algorithms for significance testing of ungapped multiple alignments
Bioinformatics, February 15, 2008; 24(4): 577 - 578.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
A. Tomovic and E. J. Oakeley
Quality estimation of multiple sequence alignments by Bayesian hypothesis testing
Bioinformatics, September 15, 2007; 23(18): 2488 - 2490.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
J. Zhang, B. Jiang, M. Li, J. Tromp, X. Zhang, and M. Q. Zhang
Computing exact P-values for DNA motifs
Bioinformatics, March 1, 2007; 23(5): 531 - 537.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
D. GuhaThakurta
Computational identification of transcriptional regulatory elements in DNA sequence
Nucleic Acids Res., July 19, 2006; 34(12): 3585 - 3598.
[Abstract] [Full Text] [PDF]

Home page
 Proc. Natl. Acad. Sci. USAHome page
T. Wang and G. D. Stormo
Identifying the conserved network of cis-regulatory sites of a eukaryotic genome
PNAS, November 29, 2005; 102(48): 17400 - 17405.
[Abstract] [Full Text] [PDF]


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.