Sciweavers

10 search results - page 2 / 2
» A Linear-Time Algorithm for the Perfect Phylogeny Haplotypin...
Sort
View
RECOMB
2004
Springer
14 years 8 months ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp
CPM
2009
Springer
122views Combinatorics» more  CPM 2009»
14 years 3 months ago
Haplotype Inference Constrained by Plausible Haplotype Data
The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, su...
Michael R. Fellows, Tzvika Hartman, Danny Hermelin...
WABI
2004
Springer
142views Bioinformatics» more  WABI 2004»
14 years 1 months ago
Linear Reduction for Haplotype Inference
Abstract. Haplotype inference problem asks for a set of haplotypes explaining a given set of genotypes. Popular software tools for haplotype inference (e.g., PHASE, HAPLOTYPER) as ...
Jingwu He, Alexander Zelikovsky
COCOON
2008
Springer
13 years 10 months ago
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
The problem of determining haplotypes from genotypes has gained considerable prominence in the research community since the beginning of the HapMap project. Here the focus is on de...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...
ACID
2006
236views Algorithms» more  ACID 2006»
13 years 10 months ago
Kernelization for Convex Recoloring
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....