Skip Navigation


Bioinformatics Advance Access originally published online on February 19, 2009
Bioinformatics 2009 25(7):969-970; doi:10.1093/bioinformatics/btp092
This Article
Right arrow Full Text
Right arrow Full Text (Print PDF)
Right arrow All Versions of this Article:
25/7/969    most recent
btp092v1
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 arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Eaves, H. L.
Right arrow Articles by Gao, Y.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Eaves, H. L.
Right arrow Articles by Gao, Y.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

MOM: maximum oligonucleotide mapping

Hugh L. Eaves 1 and Yuan Gao 1,2,*

1Center for the Study of Biological Complexity and 2Department of Computer Science, Virginia Commonwealth University, Richmond, Virginia, USA

*To whom correspondence should be addressed.


  Abstract

Summary: Current short read mapping programs are based on the reasonable premise that most sequencing errors occur near the 3' end of the read. These programs map reads with either a small number of mismatches in the entire read, or a small number of mismatches in the segment remaining after trimming bases from the 3' end or a single base from the 5' end. Though multiple sequencing errors most likely occur near the 3' end of the reads, they can still occur at the 5' end of the reads. Trimming from the 3' end will not be able to map these reads. We have developed a program, Maximum Oligonucleotide Mapping (MOM), based on the concept of query matching that is designed to capture a maximal length match within the short read satisfying the user defined error parameters. This query matching approach thus accommodates multiple sequencing errors at both ends. We demonstrate that this technique achieves greater sensitivity and a higher percentage of uniquely mapped reads when compared to existing programs such as SOAP, MAQ and SHRiMP.

Software and Test Data Availability: http://mom.csbc.vcu.edu

Contact: ygao{at}vcu.edu hleaves{at}vcu.edu

Associate Editor: Dmitrij Frishman

Received on September 22, 2008; revised on February 13, 2009; accepted on February 14, 2009

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
 Brief BioinformHome page
D. S. Horner, G. Pavesi, T. Castrignano, P. D. De Meo, S. Liuni, M. Sammeth, E. Picardi, and G. Pesole
Bioinformatics approaches for genomics and post genomics applications of next-generation sequencing
Brief Bioinform, October 27, 2009; (2009) bbp046v1.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
Y. Chen, T. Souaiaia, and T. Chen
PerM: efficient mapping of short sequencing reads with periodic full sensitive spaced seeds
Bioinformatics, October 1, 2009; 25(19): 2514 - 2521.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
H. Li and R. Durbin
Fast and accurate short read alignment with Burrows-Wheeler transform
Bioinformatics, July 15, 2009; 25(14): 1754 - 1760.
[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.