Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform

DOI10.1007/978-3-642-40450-4_12zbMath1394.68449OpenAlexW2183776810MaRDI QIDQ2849305

Veli Mäkinen, Juha Kärkkäinen, Fabio Cunial, Djamal Belazzougui

Publication date: 17 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40450-4_12

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items

Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended, Approximate string matching using a bidirectional index, Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds, Bidirectional Variable-Order de Bruijn Graphs, Combinatorics of minimal absent words for a sliding window, Wheeler graphs: a framework for BWT-based data structures, Composite Repetition-Aware Data Structures, A framework for space-efficient string kernels, Lossless Seeds for Searching Short Patterns with High Error Rates, Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets, Algorithms and complexity on indexing founder graphs, Computing all-vs-all MEMs in run-length-encoded collections of HiFi reads, Fast compressed self-indexes with deterministic linear-time construction, Unnamed Item, Minimal forbidden factors of circular words, Alignment-free sequence comparison using absent words, Absent words in a sliding window with applications, Constructing antidictionaries of long texts in output-sensitive space, Fast Compressed Self-Indexes with Deterministic Linear-Time Construction