Cargando…

Rapid haplotype inference for nuclear families

Hapi is a new dynamic programming algorithm that ignores uninformative states and state transitions in order to efficiently compute minimum-recombinant and maximum likelihood haplotypes. When applied to a dataset containing 103 families, Hapi performs 3.8 and 320 times faster than state-of-the-art a...

Descripción completa

Detalles Bibliográficos
Autores principales: Williams, Amy L, Housman, David E, Rinard, Martin C, Gifford, David K
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2010
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3218664/
https://www.ncbi.nlm.nih.gov/pubmed/21034477
http://dx.doi.org/10.1186/gb-2010-11-10-r108
Descripción
Sumario:Hapi is a new dynamic programming algorithm that ignores uninformative states and state transitions in order to efficiently compute minimum-recombinant and maximum likelihood haplotypes. When applied to a dataset containing 103 families, Hapi performs 3.8 and 320 times faster than state-of-the-art algorithms. Because Hapi infers both minimum-recombinant and maximum likelihood haplotypes and applies to related individuals, the haplotypes it infers are highly accurate over extended genomic distances.