Skip Navigation



Bioinformatics Advance Access published online on October 27, 2009

Bioinformatics, doi:10.1093/bioinformatics/btp614
This Article
Right arrow Advance Access manuscript (PDF)
Right arrow Supplementary Data
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 Clement, N. L.
Right arrow Articles by Johnson, W. E.
PubMed
Right arrow PubMed Citation
Right arrow Articles by Clement, N. L.
Right arrow Articles by Johnson, W. E.
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

The GNUMAP Algorithm: Unbiased Probabilistic Mapping of Oligonucleotides from Next-Generation Sequencing

Nathan L. Clement 1,*, Quinn Snell 1, Mark J. Clement 1, Peter C. Hollenhorst 3, Jahnvi Purwar 3, Barbara J. Graves 3, Bradley R. Cairns 3 and W. Evan Johnson 2,3

1Department of Computer Science, Brigham Young University, Provo, UT, 84602
2Department of Statistics, Brigham Young University, Provo, UT, 84602
3Department of Oncological Sciences, Huntsman Cancer Institute, University of Utah, Salt Lake City, UT, 84105

*To whom correspondence should be addressed. Nathan L. Clement, E-mail: nathanlclement{at}gmail.com


   Abstract

Motivation: The advent of next-generation sequencing technologies has increased the accuracy and quantity of sequence data, opening the door to greater opportunities in genomic research.

Results: In this paper, we present GNUMAP (Genomic Nextgeneration Universal MAPper), a program capable of overcoming two major obstacles in the mapping of reads from next-generation sequencing runs. First, we have created an algorithm that probabilistically maps reads to repeat regions in the genome on a quantitative basis. Second, we have developed a probabilistic Needleman-Wunsch algorithm which utilizes _prb.txt and _int.txt files produced in the Solexa/Illumina pipeline to improve the mapping accuracy for lower quality reads and increase the amount of usable data produced in a given experiment.

Availability: The source code for the software can be downloaded from http://dna.cs.byu.edu/gnumap.

Contact: nathanlclement{at}gmail.com

Associate Editor: Prof. John Quackenbush


Received on May 18, 2009; revised on September 24, 2009; accepted on October 16, 2009

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.