Back to Results
First PageMeta Content
Haplotype / Function / Matrix / Gaussian elimination / Genetics / Mathematics / Genetic genealogy


Efficient Reconstruction of Haplotype Structure via Perfect Phylogeny
Add to Reading List

Document Date: 2002-09-05 13:38:41


Open Document

File Size: 180,23 KB

Share Result on Facebook

Company

CNF / Solving TPPH / /

/

Facility

University of California Berkeley / Columbia University / Soda Hall / International Computer Science Institute / /

IndustryTerm

legal solution / given site / possible solution / elegant polynomial-time algorithm / log n-approximation algorithm / polynomial time algorithm / maximal site / heterozygous site / consistent solution / polynomial-time algorithm / α-approximation algorithm / heavy machinery / polymorphism site / possible solutions / legal solutions / /

Organization

Columbia University / University of California / National Institute of Health / CS Division / International Computer Science Institute / Computer Science Department / /

Person

Richard M. Karp / Wc / Eran Halperin† Richard / Eleazar Eskin Eran Halperin Richard / Eleazar Eskin∗ Eran Halperin / /

Position

coalescent model / or perfect phylogeny / /

ProvinceOrState

California / /

Technology

α-approximation algorithm / main algorithm / A. The algorithm / polynomial time algorithm / polynomial-time algorithm / 6 ALGORITHM / elegant polynomial-time algorithm / SNP / log n-approximation algorithm / genotype / 4 The Build-Tree algorithm / human genome / /

SocialTag