Rxivist logo

A Flow Procedure for the Linearization of Genome Sequence Graphs.

By David Haussler, Maciej Smuga-Otto, Benedict Paten, Adam M. Novak, Sergei Nikitin, Maria Zueva, Dmitrii Miagkov

Posted 18 Jan 2017
bioRxiv DOI: 10.1101/101501 (published DOI: 10.1089/cmb.2017.0248)

Efforts to incorporate human genetic variation into the reference human genome have converged on the idea of a graph representation of genetic variation within a species, a genome sequence graph. A sequence graph represents a set of individual haploid reference genomes as paths in a single graph. When that set of reference genomes is sufficiently diverse, the sequence graph implicitly contains all frequent human genetic variations, including translocations, inversions, deletions, and insertions. In representing a set of genomes as a sequence graph one encounters certain challenges. One of the most important is the problem of graph linearization, essential both for efficiency of storage and access, as well as for natural graph visualization and compatibility with other tools. The goal of graph linearization is to order nodes of the graph in such a way that operations such as access, traversal and visualization are as efficient and effective as possible. A new algorithm for the linearization of sequence graphs, called the flow procedure, is proposed in this paper. Comparative experimental evaluation of the flow procedure against other algorithms shows that it outperforms its rivals in the metrics most relevant to sequence graphs.

Download data

  • Downloaded 984 times
  • Download rankings, all-time:
    • Site-wide: 14,265 out of 106,159
    • In bioinformatics: 2,199 out of 9,474
  • Year to date:
    • Site-wide: 82,461 out of 106,159
  • Since beginning of last month:
    • Site-wide: 79,726 out of 106,159

Altmetric data

Downloads over time

Distribution of downloads per paper, site-wide


Sign up for the Rxivist weekly newsletter! (Click here for more details.)