|
|
- 2019
External memory BWT and LCP computation for sequence collections with applicationsDOI: 10.1186/s13015-019-0140-0 Keywords: Burrows–Wheeler Transform, Longest common prefix array, Maximal repeats, All pairs suffix–prefix overlaps, Succinct de Bruijn graph, External memory algorithms Abstract: LCP array and BWT for s 1 = abcab $ 1 and s 2 = aabcabc $ 2 , and multi-string BWT and corresponding LCP array for the same strings. Column id shows, for each entry of bwt 12 = bc $ 2 cc $ 1 aaaabbb whether it comes from s 1 or s
|
