activity
20052026
most citedPhylogenetic Networks Do not Need to Be Complex: Using Fewer Reticulations to Represent Conflicting Clusters

11 citations · 59 across the 20 of their papers we have counts for

collaborators
Showing q-bio.OTShow all

1 paper · 1 filter

q-bio.OT2006★ 1 cited

Shorelines of islands of tractability: Algorithms for parsimony and minimum perfect phylogeny haplotyping problems

Leo van Iersel, Judith Keijsper, Steven Kelk +1

The problem Parsimony Haplotyping (PH) asks for the smallest set of haplotypes which can explain a given set of genotypes, and the problem Minimum Perfect Phylogeny Haplotyping (MP…