Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 133-144
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Alphabet-Independent Compressed Text IndexingACM Transactions on Algorithms, 2014
- Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences2012
- Optimal Succinctness for Range Minimum Queries2010
- Faster entropy-bounded compressed suffix treesTheoretical Computer Science, 2009
- Monotone Minimal Perfect Hashing: Searching a Sorted Table with O(1) Accesses2009
- Monotony of surprise and large-scale quest for unusual words2002
- Efficient Detection of Unusual WordsJournal of Computational Biology, 2000
- Algorithms on Strings, Trees and Sequences1997
- An on-line string superprimitivity testInformation Processing Letters, 1992
- The Myriad Virtues of Subword Trees1985