Bioinformatics Advance Access published online on December 5, 2007
Bioinformatics, doi:10.1093/bioinformatics/btm542
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Assembly Reconciliation
1IPST, University of Maryland, College Park, 2USA; Agencourt Bioscience Inc., Beverly, MA., USA; 3The J. Craig Venter Instutute, Rockville, MD, USA.
*To whom correspondence should be addressed. Dr. Aleksey V Zimin, E-mail: alekseyz{at}ipst.umd.edu
| Abstract |
|---|
Motivation: Many genomes are sequenced by a collaboration of several centers, and then each center produces an assembly using their own assembly software. The collaborators then pick the draft assembly that they judge to be the best and the information contained in the other assemblies is usually not used.
Methods: We have developed a technique that we call assembly reconciliation that can merge draft genome assemblies. It takes one draft assembly, detects apparent errors, and, when possible, patches the problem areas using pieces from alternative draft assemblies. It also closes gaps in places where one of the alternative assemblies has spanned the gap correctly.
Results: Using the Assembly Reconciliation technique we produced reconciled assemblies of six Drosophila species in collaboration with Agencourt Bioscience and The J. Craig Venter Institute. These assemblies are now the official (CAF1) assemblies used for analysis. We also produced a reconciled assembly of Rhesus Macaque genome, and this assembly is available from our website http://www.genome.umd.edu.
Availability: The reconciliation software is available for download from http://www.genome.umd.edu/software.htm.
Contact: Aleksey Zimin alekseyz{at}ipst.umd.edu.
Associate Editor: Dr. Alex Bateman
Received on August 7, 2007; revised on October 15, 2007; accepted on October 22, 2007
This article has been cited by other articles:
![]() |
M. Pop Genome assembly reborn: recent computational challenges Brief Bioinform, July 1, 2009; 10(4): 354 - 366. [Abstract] [Full Text] [PDF] |
||||
