Skip Navigation


Bioinformatics Advance Access originally published online on February 24, 2006
Bioinformatics 2006 22(10):1217-1224; doi:10.1093/bioinformatics/btl063
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
22/10/1217    most recent
btl063v1
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 ISI Web of Science
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 (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Valouev, A.
Right arrow Articles by Waterman, M. S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Valouev, A.
Right arrow Articles by Waterman, M. S.
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

Refinement of optical map assemblies

Anton Valouev 1,2,*,{dagger}, Yu Zhang 3,{dagger}, David C. Schwartz 4 and Michael S. Waterman 2

1 MCB 1050 Childs Way, Los Angeles, CA 90089-2910, USA
2 Department of Mathematics, University of Southern California Los Angeles, CA, USA
3 Department of Statistics, Harvard University MA, USA
4 Laboratory for Molecular and Computational Genomics, Departments of Genetics and Chemistry, University of Wisconsin-Madison WI, USA

*To whom correspondence should be addressed.

Motivation: Genomic mutations and variations provide insightful information about the functionality of sequence elements and their association with human diseases. Traditionally, variations are identified through analysis of short DNA sequences, usually shorter than 1000 bp per fragment. Optical maps provide both faster and more cost-efficient means for detecting such differences, because a single map can span over 1 million bp. Optical maps are assembled to cover the whole genome, and the accuracy of assembly is critical.

Results: We present a computationally efficient model-based method for improving quality of such assemblies. Our method provides very high accuracy even with moderate coverage (<20 x). We utilize a hidden Markov model to represent the consensus map and use the expectation-Maximization algorithm to drive the refinement process. We also provide quality scores to assess the quality of the finished map.

Availability: Code is available from www.cmb.usc.edu/people/valouev/

Contact: valouev{at}usc.edu

Received on September 30, 2005; revised on February 2, 2006; accepted on February 19, 2006

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
 Proc. Natl. Acad. Sci. USAHome page
A. Valouev, D. C. Schwartz, S. Zhou, and M. S. Waterman
An algorithm for assembly of ordered restriction maps from single DNA molecules
PNAS, October 24, 2006; 103(43): 15770 - 15775.
[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.