|
|
- 2019
Linear time minimum segmentation enables scalable founder reconstructionDOI: 10.1186/s13015-019-0147-6 Keywords: Pan-genome indexing, Founder reconstruction, Dynamic programming, Positional Burrows–Wheeler transform, Range minimum query Abstract: The pBWT for a set of recombinants R = { R 1 , … , R 6 } with k = 7 and the corresponding trie containing the reversed strings R 1 [ 1 , k ] , … , R 6 [ 1 , k ] in lexicographic orde
|
