Versatile succinct representations of the bidirectional Burrows-Wheeler transform

DOI10.1007/978-3-642-40450-4_12MaRDI QIDQ2849305zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Smaller Fully-Functional Bidirectional BWT Indexes
• Linear-time string indexing and analysis in small space
• Space-efficient construction of compressed suffix trees
• Fast BWT in small space by blockwise suffix sorting
• XBWT tricks

Cited in

(28)

• Wheeler graphs: a framework for BWT-based data structures
• Alignment-free sequence comparison using absent words
• XBWT tricks
• Fast compressed self-indexes with deterministic linear-time construction
• Constructing antidictionaries of long texts in output-sensitive space
• Combinatorics of minimal absent words for a sliding window
• Absent words in a sliding window with applications
• Faster average case low memory semi-external construction of the Burrows-Wheeler transform
• A bijective variant of the Burrows-Wheeler transform using V-order
• Approximate search of short patterns with high error rates using the 01^ 0 lossless seeds
• Composite repetition-aware data structures
• Lossless seeds for searching short patterns with high error rates
• Approximate string matching using a bidirectional index
• FUNCTIONAL PEARL Inverting the Burrows–Wheeler transform
• Linear-time string indexing and analysis in small space
• scientific article; zbMATH DE number 7559178 (Why is no real title available?)
• Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
• Bidirectional Variable-Order de Bruijn Graphs
• Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
• Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
• Algorithms and complexity on indexing founder graphs
• Trickier XBWT tricks
• Computing all-vs-all MEMs in run-length-encoded collections of HiFi reads
• Smaller Fully-Functional Bidirectional BWT Indexes
• Minimal absent words in rooted and unrooted trees
• Linear-time computation of generalized minimal absent words for multiple strings
• Exploiting new properties of string net frequency for efficient computation
• Computing MEMs and relatives on repetitive text collections

This page was built for publication: Versatile succinct representations of the bidirectional Burrows-Wheeler transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849305)