%0 Journal Article
%T Linear time minimum segmentation enables scalable founder reconstruction
%A Bastien Cazaux
%A Dmitry Kosolobov
%A Tuukka Norri
%J Archive of "Algorithms for Molecular Biology : AMB".
%D 2019
%R 10.1186/s13015-019-0147-6
%X 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
%K Pan-genome indexing
%K Founder reconstruction
%K Dynamic programming
%K Positional Burrows¨CWheeler transform
%K Range minimum query
%U https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6525415/