Cargando…
A fast algorithm for genome-wide haplotype pattern mining
BACKGROUND: Identifying the genetic components of common diseases has long been an important area of research. Recently, genotyping technology has reached the level where it is cost effective to genotype single nucleotide polymorphism (SNP) markers covering the entire genome, in thousands of individ...
Autores principales: | Besenbacher, Søren, Pedersen, Christian NS, Mailund, Thomas |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2009
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2648728/ https://www.ncbi.nlm.nih.gov/pubmed/19208179 http://dx.doi.org/10.1186/1471-2105-10-S1-S74 |
Ejemplares similares
-
Assembly and analysis of 100 full MHC haplotypes from the Danish population
por: Jensen, Jacob M., et al.
Publicado: (2017) -
Whole genome association mapping by incompatibilities and local perfect phylogenies
por: Mailund, Thomas, et al.
Publicado: (2006) -
A sub-cubic time algorithm for computing the quartet distance between two general trees
por: Nielsen, Jesper, et al.
Publicado: (2011) -
Fast calculation of the quartet distance between trees of arbitrary degrees
por: Christiansen, Chris, et al.
Publicado: (2006) -
zipHMMlib: a highly optimised HMM library exploiting repetitions in the input to speed up the forward algorithm
por: Sand, Andreas, et al.
Publicado: (2013)