Related references
Note: Only part of the references are listed.SNPs detection by eBWT positional clustering
Nicola Prezza et al.
ALGORITHMS FOR MOLECULAR BIOLOGY (2019)
External memory BWT and LCP computation for sequence collections with applications
Lavinia Egidi et al.
ALGORITHMS FOR MOLECULAR BIOLOGY (2019)
Generalized enhanced suffix array construction in external memory
Felipe A. Louza et al.
ALGORITHMS FOR MOLECULAR BIOLOGY (2017)
Lightweight LCP construction for very large collections of strings
Anthony J. Cox et al.
JOURNAL OF DISCRETE ALGORITHMS (2016)
An improved algorithm for the all-pairs suffix-prefix problem
William H. A. Tustumi et al.
JOURNAL OF DISCRETE ALGORITHMS (2016)
The wavelet matrix: An efficient wavelet tree for large alphabets
Francisco Claude et al.
INFORMATION SYSTEMS (2015)
Merging of multi-string BWTs with applications
James Holt et al.
BIOINFORMATICS (2014)
OPTIMAL DYNAMIC SEQUENCE REPRESENTATIONS
Gonzalo Navarro et al.
SIAM JOURNAL ON COMPUTING (2014)
Wavelet trees for all
Gonzalo Navarro
JOURNAL OF DISCRETE ALGORITHMS (2014)
Lightweight algorithms for constructing and inverting the BWT of string collections
Markus J. Bauer et al.
THEORETICAL COMPUTER SCIENCE (2013)
Computing the longest common prefix array based on the Burrows-Wheeler transform
Timo Beller et al.
JOURNAL OF DISCRETE ALGORITHMS (2013)
BREAKING A TIME-AND-SPACE BARRIER IN CONSTRUCTING FULL-TEXT INDICES
Wing-Kai Hon et al.
SIAM JOURNAL ON COMPUTING (2009)
Fast BWT in small space by blockwise suffix sorting
Juha Karkkainen
THEORETICAL COMPUTER SCIENCE (2007)
An extension of the Burrows-Wheeler transform
S. Mantaci et al.
THEORETICAL COMPUTER SCIENCE (2007)
Compressed suffix trees with full functionality
Kunihiko Sadakane
THEORY OF COMPUTING SYSTEMS (2007)
Representing trees of higher degree
D Benoit et al.
ALGORITHMICA (2005)
Compressed suffix arrays and suffix trees with applications to text indexing and string matching
R Grossi et al.
SIAM JOURNAL ON COMPUTING (2005)
Share Paper
