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

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 data...

Descripción completa

Detalles Bibliográficos
Autor principal: Durbin, Richard
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Oxford University Press 2014
Materias:
Original Papers
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3998136/
https://www.ncbi.nlm.nih.gov/pubmed/24413527
http://dx.doi.org/10.1093/bioinformatics/btu014

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3998136/
https://www.ncbi.nlm.nih.gov/pubmed/24413527
http://dx.doi.org/10.1093/bioinformatics/btu014

Ejemplares similares