Randomized trial demonstrates efficient haplotype retrieval in genomic sequences, suggesting improved data structure performance.
Key Points
This research aims to enhance the efficiency of the Positional Burrows-Wheeler Transform (PBWT) for genomic sequences by developing a new data structure.
Established bounds on the size of runs in the multi-allelic PBWT.
Introduced an O(r̃)-word data structure supporting constant-time forward and backward stepping.
Designed efficient solutions for haplotype retrieval and prefix search operations.
Developed a haplotype retrieval structure achieving O(log log_w h + w) time complexity.