 | 2009 |
|---|
| 10 |       | Leo van Iersel,
Matthias Mnich:
Computing Rooted and Unrooted Maximum Consistent Supertrees
CoRR abs/0901.3299: (2009) |
| 9 | | Leo van Iersel,
Steven Kelk,
Matthias Mnich:
Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks.
J. Bioinformatics and Computational Biology 7(4): 597-623 (2009) |
| 2008 |
|---|
| 8 | | Leo van Iersel,
Steven Kelk:
Constructing the Simplest Possible Phylogenetic Network from Triplets.
ISAAC 2008: 472-483 |
| 7 | | Leo van Iersel,
Judith Keijsper,
Steven Kelk,
Leen Stougie,
Ferry Hagen,
Teun Boekhout:
Constructing Level-2 Phylogenetic Networks from Triplets.
RECOMB 2008: 450-462 |
| 6 | | Leo van Iersel,
Judith Keijsper,
Steven Kelk,
Leen Stougie:
Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 301-312 (2008) |
| 2007 |
|---|
| 5 | | Cor A. J. Hurkens,
Leo van Iersel,
Judith Keijsper,
Steven Kelk,
Leen Stougie,
John Tromp:
Prefix Reversals on Binary and Ternary Strings.
AB 2007: 292-306 |
| 4 | | Rudi Cilibrasi,
Leo van Iersel,
Steven Kelk,
John Tromp:
The Complexity of the Single Individual SNP Haplotyping Problem.
Algorithmica 49(1): 13-36 (2007) |
| 3 | | Cor A. J. Hurkens,
Leo van Iersel,
Judith Keijsper,
Steven Kelk,
Leen Stougie,
John Tromp:
Prefix Reversals on Binary and Ternary Strings.
SIAM J. Discrete Math. 21(3): 592-611 (2007) |
| 2006 |
|---|
| 2 | | Leo van Iersel,
Judith Keijsper,
Steven Kelk,
Leen Stougie:
Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems.
WABI 2006: 80-91 |
| 2005 |
|---|
| 1 | | Rudi Cilibrasi,
Leo van Iersel,
Steven Kelk,
John Tromp:
On the Complexity of Several Haplotyping Problems.
WABI 2005: 128-139 |
