Efficient haplotype matching and storage using the positional Burrows-Wheeler transform (PBWT).
Durbin R. · 2014
Read Efficient haplotype matching and storage using the positional Burrows-Wheeler transform (PBWT). by Durbin R. (2014) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/europmc-pmc3998136.txt.
Description
Richard Durbin presents a fast method for matching and storing haplotypes, in Bioinformatics in 2014. A haplotype is a stretch of gene variants carried on one chromosome copy. Finding long matches between such stretches helps trace shared ancestry and fill gaps in gene data. Pair-by-pair checks grow far too slow as data sets swell.
Durbin borrows ideas from suffix arrays, tools long used to search DNA reads at speed. His method, the positional Burrows-Wheeler transform, sorts the data by position in a way that packs down well. On large sets the packed form was more than a hundred times smaller than raw data squeezed by a standard tool. The layout lets a program list all longest matches across a set in time that grows in a straight line with set size. It can also match a new stretch against the set fast. Uses in phasing are sketched.
Catalog record
| CREATOR | Durbin R. |
|---|---|
| YEAR | 2014 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 34 KB |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |