|
|
- 2019
Prefix-free parsing for building big BWTsDOI: 10.1186/s13015-019-0148-5 Keywords: Burrows-Wheeler Transform, Prefix-free parsing, Compression-aware algorithms, Genomic databases Abstract: 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
|
