%0 Journal Article
%T Prefix-free parsing for building big BWTs
%A Alan Kuhnle
%A Ben Langmead
%A Christina Boucher
%A Giovanni Manzini
%A Travis Gagie
%J Archive of "Algorithms for Molecular Biology : AMB".
%D 2019
%R 10.1186/s13015-019-0148-5
%X The suffix trie for our example with the three strings GATTACAT, GATACAT and GATTAGATA. The input is shown at the bottom, in red because we do not need to store i
%K Burrows-Wheeler Transform
%K Prefix-free parsing
%K Compression-aware algorithms
%K Genomic databases
%U https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6534911/