Haplotype-aware graph indexes

05/10/2018
by   Jouni Sirén, et al.
0

The variation graph toolkit (VG) represents genetic variation as a graph. Each path in the graph is a potential haplotype, though most paths are unlikely recombinations of true haplotypes. We augment the VG model with haplotype information to identify which paths are more likely to be correct. For this purpose, we develop a scalable implementation of the graph extension of the positional Burrows-Wheeler transform. We demonstrate the scalability of the new implementation by indexing the 1000 Genomes Project haplotypes. We also develop an algorithm for simplifying variation graphs for k-mer indexing without losing any k-mers in the haplotypes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/31/2023

A variation of Reynolds-Hurkens Paradox

We present a variation of Hurkens paradox, which can itself be seen as a...
research
07/06/2023

Shortest Beer Path Queries based on Graph Decomposition

Given a directed edge-weighted graph G=(V, E) with beer vertices B⊆ V, a...
research
08/01/2022

Two New Characterizations of Path Graphs

Path graphs are intersection graphs of paths in a tree. We start from th...
research
01/29/2021

r-indexing Wheeler graphs

Let G be a Wheeler graph and r be the number of runs in a Burrows-Wheele...
research
08/10/2021

Tangled Paths: A Random Graph Model from Mallows Permutations

We introduce the random graph 𝒫(n,q) which results from taking the union...
research
05/16/2022

The Hamiltonian Path Graph is Connected for Simple s,t Paths in Rectangular Grid Graphs

A simple s,t path P in a rectangular grid graph 𝔾 is a Hamiltonian path ...
research
12/10/2020

Path Optimization Sheaves

Motivated by efforts to incorporate sheaves into networking, we seek to ...

Please sign up or login with your details

Forgot password? Click here to reset