### Skapa referens, olika format (klipp och klistra)

**Harvard**

Damaschke, P. (2003) *Fast perfect phylogeny haplotype inference*.

** BibTeX **

@conference{

Damaschke2003,

author={Damaschke, Peter},

title={Fast perfect phylogeny haplotype inference},

booktitle={Lecture Notes in Computer Science. 14th International Symposium on Fundamentals of Computation Theory FCT'2003, Malmö, 12-15 August 2003},

isbn={3-540-40543-7},

pages={183-194},

abstract={We address the problem of reconstructing haplotypes in a population, given a sample of genotypes and assumptions about the underlying population. The problem is of major interest in genetics because haplotypes are more
informative than genotypes when it comes to searching for trait genes, but it is difficult to get them directly by sequencing. After showing that simple resolution-based inference can be terribly wrong in some natural types of
population, we propose a different combinatorial approach exploiting intersections of sampled genotypes (considered
as sets of candidate haplotypes). For populations with perfect phylogeny we obtain an inference algorithm which is both sound and efficient. It yields with high propability
the complete set of haplotypes showing up in the sample,
for a sample size close to the trivial lower bound. The perfect phylogeny assumption is often justified, but we
also believe that the ideas can be further extended to
populations obeying relaxed structural assumptions. The ideas are quite different from other existing practical algorithms for the problem.},

year={2003},

}

** RefWorks **

RT Conference Proceedings

SR Electronic

ID 1741

A1 Damaschke, Peter

T1 Fast perfect phylogeny haplotype inference

YR 2003

T2 Lecture Notes in Computer Science. 14th International Symposium on Fundamentals of Computation Theory FCT'2003, Malmö, 12-15 August 2003

SN 3-540-40543-7

SP 183

OP 194

AB We address the problem of reconstructing haplotypes in a population, given a sample of genotypes and assumptions about the underlying population. The problem is of major interest in genetics because haplotypes are more
informative than genotypes when it comes to searching for trait genes, but it is difficult to get them directly by sequencing. After showing that simple resolution-based inference can be terribly wrong in some natural types of
population, we propose a different combinatorial approach exploiting intersections of sampled genotypes (considered
as sets of candidate haplotypes). For populations with perfect phylogeny we obtain an inference algorithm which is both sound and efficient. It yields with high propability
the complete set of haplotypes showing up in the sample,
for a sample size close to the trivial lower bound. The perfect phylogeny assumption is often justified, but we
also believe that the ideas can be further extended to
populations obeying relaxed structural assumptions. The ideas are quite different from other existing practical algorithms for the problem.

LA eng

DO 10.1007/978-3-540-45077-1_18

LK http://dx.doi.org/10.1007/978-3-540-45077-1_18

OL 30