Display Settings:

Format

Send to:

Choose Destination
We are sorry, but NCBI web applications do not support your browser and may not function properly. More information
Bioinformatics. 2012 Jan 1;28(1):13-6. doi: 10.1093/bioinformatics/btr588. Epub 2011 Oct 23.

Graph accordance of next-generation sequence assemblies.

Author information

  • 1The Genome Institute, Washington University School of Medicine, 4444 Forest Park Avenue, St Louis, MO 63108, USA.

Abstract

MOTIVATION:

No individual assembly algorithm addresses all the known limitations of assembling short-length sequences. Overall reduced sequence contig length is the major problem that challenges the usage of these assemblies. We describe an algorithm to take advantages of different assembly algorithms or sequencing platforms to improve the quality of next-generation sequence (NGS) assemblies.

RESULTS:

The algorithm is implemented as a graph accordance assembly (GAA) program. The algorithm constructs an accordance graph to capture the mapping information between the target and query assemblies. Based on the accordance graph, the contigs or scaffolds of the target assembly can be extended, merged or bridged together. Extra constraints, including gap sizes, mate pairs, scaffold order and orientation, are explored to enforce those accordance operations in the correct context. We applied GAA to various chicken NGS assemblies and the results demonstrate improved contiguity statistics and higher genome and gene coverage.

AVAILABILITY:

GAA is implemented in OO perl and is available here: http://sourceforge.net/projects/gaa-wugi/.

CONTACT:

lye@genome.wustl.edu

PMID:
22025481
[PubMed - indexed for MEDLINE]
PMCID:
PMC3244760
Free PMC Article

Images from this publication.See all images (2)Free text

Fig. 1.
Fig. 2.
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Full text links

    Icon for HighWire Icon for PubMed Central
    Loading ...
    Write to the Help Desk