Fig. 1
From: Linear time minimum segmentation enables scalable founder reconstruction
The pBWT for a set of recombinants \({\mathcal {R}} = \{R_1, \ldots , R_6\}\) with \(k = 7\) and the corresponding trie containing the reversed strings \(R_1[1,k], \ldots , R_6[1,k]\) in lexicographic order