A Sequence Distance Graph framework for genome assembly and analysis

  • Yanes L
  • Garcia Accinelli G
  • Wright J
  • et al.
N/ACitations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

The Sequence Distance Graph (SDG) framework works with genome assembly graphs and raw data from paired, linked and long reads. It includes a simple deBruijn graph module, and can import graphs using the graphical fragment assembly (GFA) format. It also maps raw reads onto graphs, and provides a Python application programming interface (API) to navigate the graph, access the mapped and raw data and perform interactive or scripted analyses. Its complete workspace can be dumped to and loaded from disk, decoupling mapping from analysis and supporting multi-stage pipelines. We present the design andimplementation of the framework, and example analyses scaffolding a short read graph with long reads, and navigating paths in a heterozygous graph for a simulated parent-offspring trio dataset. SDG  is  freely  available  under  the  MIT  license  at https://github.com/bioinfologics/sdg

Cite

CITATION STYLE

APA

Yanes, L., Garcia Accinelli, G., Wright, J., Ward, B. J., & Clavijo, B. J. (2019). A Sequence Distance Graph framework for genome assembly and analysis. F1000Research, 8, 1490. https://doi.org/10.12688/f1000research.20233.1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free