License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.WABI.2019.7
URN: urn:nbn:de:0030-drops-110375
URL: http://drops.dagstuhl.de/opus/volltexte/2019/11037/
Go to the corresponding LIPIcs Volume Portal


Vaddadi, Kavya ; Srinivasan, Rajgopal ; Sivadasan, Naveen

Read Mapping on Genome Variation Graphs

pdf-format:
LIPIcs-WABI-2019-7.pdf (0.6 MB)


Abstract

Genome variation graphs are natural candidates to represent a pangenome collection. In such graphs, common subsequences are encoded as vertices and the genomic variations are captured by introducing additional labeled vertices and directed edges. Unlike a linear reference, a reference graph allows a rich representation of the genomic diversities and avoids reference bias. We address the fundamental problem of mapping reads to genome variation graphs. We give a novel mapping algorithm V-MAP for efficient identification of small subgraph of the genome graph for optimal gapped alignment of the read. V-MAP creates space efficient index using locality sensitive minimizer signatures computed using a novel graph winnowing and graph embedding onto metric space for fast and accurate mapping. Experiments involving graph constructed from the 1000 Genomes data and using both real and simulated reads show that V-MAP is fast, memory efficient and can map short reads, as well as PacBio/Nanopore long reads with high accuracy. V-MAP performance was significantly better than the state-of-the-art, especially for long reads.

BibTeX - Entry

@InProceedings{vaddadi_et_al:LIPIcs:2019:11037,
  author =	{Kavya Vaddadi and Rajgopal Srinivasan and Naveen Sivadasan},
  title =	{{Read Mapping on Genome Variation Graphs}},
  booktitle =	{19th International Workshop on Algorithms in Bioinformatics (WABI 2019)},
  pages =	{7:1--7:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-123-8},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{143},
  editor =	{Katharina T. Huber and Dan Gusfield},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11037},
  URN =		{urn:nbn:de:0030-drops-110375},
  doi =		{10.4230/LIPIcs.WABI.2019.7},
  annote =	{Keywords: read mapping, pangenome, genome variation graphs, locality sensitive hashing}
}

Keywords: read mapping, pangenome, genome variation graphs, locality sensitive hashing
Seminar: 19th International Workshop on Algorithms in Bioinformatics (WABI 2019)
Issue Date: 2019
Date of publication: 06.09.2019


DROPS-Home | Imprint | Privacy Published by LZI