Indexing Variation Graphs
From MaRDI portal
Publication:5232561
DOI10.1137/1.9781611974768.2zbMath1430.68104arXiv1604.06605OpenAlexW3100935868MaRDI QIDQ5232561
Publication date: 12 September 2019
Published in: 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.06605
Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Genetics and epigenetics (92D10) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (16)
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended ⋮ AStarix: Fast and Optimal Sequence-to-Graph Alignment ⋮ Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails ⋮ Bidirectional Variable-Order de Bruijn Graphs ⋮ Wheeler graphs: a framework for BWT-based data structures ⋮ Computational graph pangenomics: a tutorial on data structures and their applications ⋮ FM-index of alignment with gaps ⋮ Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails ⋮ Pattern Matching on Elastic-Degenerate Text with Errors ⋮ Approximate pattern matching on elastic-degenerate text ⋮ Lightweight merging of compressed indices based on BWT variants ⋮ Wheeler languages ⋮ Read Mapping on Genome Variation Graphs ⋮ Haplotype-aware graph indexes ⋮ Unnamed Item ⋮ Space efficient merging of de Bruijn graphs and Wheeler graphs
Uses Software
This page was built for publication: Indexing Variation Graphs
