Efficient haplotype matching and storage using the positional Burrows–Wheeler transform (PBWT)

@inproceedings{Durbin2014EfficientHM,
  title={Efficient haplotype matching and storage using the positional Burrows–Wheeler transform (PBWT)},
  author={Richard Durbin},
  booktitle={Bioinformatics},
  year={2014}
}
MOTIVATION Over the last few years, methods based on suffix arrays using the Burrows-Wheeler Transform have been widely used for DNA sequence read matching and assembly. These provide very fast search algorithms, linear in the search pattern size, on a highly compressible representation of the dataset being searched. Meanwhile, algorithmic development for genotype data has concentrated on statistical methods for phasing and imputation, based on probabilistic matching to hidden Markov model… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 58 times over the past 90 days. VIEW TWEETS

Citations

Publications citing this paper.
Showing 1-10 of 54 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Similar Papers

Loading similar papers…