scientific article; zbMATH DE number 7651154
From MaRDI portal
Publication:5874481
DOI10.4230/LIPICS.ESA.2020.15MaRDI QIDQ5874481FDOQ5874481
Authors: Jason Bentley, Daniel Gibney, Sharma V. Thankachan 
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/1911.03035
Title of this publication is not available (Why is that?)
Cites Work
- Efficient construction of a complete index for pan-genomics read alignment
- Title not available (Why is that?)
- Optimization, approximation, and complexity classes
- Lower bounds based on the exponential time hypothesis
- Parameterized algorithms
- The Traveling Salesman Problem with Distances One and Two
- Storage and Retrieval of Individual Genomes
- On the sorting-complexity of suffix tree construction
- Combinatorial Pattern Matching
- A faster implementation of online RLBWT and its application to LZ77 parsing
- At the roots of dictionary compression: string attractors
- Wheeler graphs: a framework for BWT-based data structures
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- Online LZ77 parsing and matching statistics with RLBWTs
- Regular Languages meet Prefix Sorting
- Optimal construction of compressed indexes for highly repetitive texts
- Block sorting-based transformations on words: beyond the magic BWT
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs
- A new class of searchable and provably highly compressible string transformations
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874481)
