Homepage of Leo van Iersel
2WO12 Optimalisering in Netwerken
Mareike Fischer, Leo van Iersel, Steven Kelk and Celine Scornavacca, On Computing the Maximum Parsimony Score of a Phylogenetic Network, arXiv:1302.2430 [q-bio.PE] (2013).
Leo van Iersel and Simone Linz, A quadratic kernel for computing the hybridization number of multiple trees, Information Processing Letters 113 (9), pp. 318–323 (2013). (arXiv)
Leo van Iersel, Steven Kelk, Nela Lekić and Leen Stougie, Approximation algorithms for nonbinary agreement forests, arXiv:1210.3211 [math.CO] (2012).
Leo van Iersel and Vincent Moulton, Trinets encode tree-child and level-2 phylogenetic networks, accepted to appear in Journal of Mathematical Biology, preprint in arXiv:1210.0362 [q-bio.PE] (2012).
Book Review: Basic Phylogenetic Combinatorics. -- Andreas Dress, Katharina T. Huber, Jacobus Koolen, Vincent Moulton and Andreas Spillner. Leo van Iersel, Systematic Biology 2012. (free-access link)
Leo van Iersel, Steven Kelk, Nela Lekić and Celine Scornavacca, A practical approximation algorithm for solving massive instances of hybridization number, proceedings of WABI 2012, LNCS 7534, pp. 430-440 (2012). (arXiv)
Steven Kelk, Leo van Iersel, Nela Lekić, Simone Linz, Celine Scornavacca and Leen Stougie, Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set, SIAM Journal on Discrete Mathematics, 26(4), pp. 1635–1656 (2012). (arXiv)
Gregory Gutin, Leo van Iersel, Matthias Mnich and Anders Yeo, Every Ternary Permutation Constraint Satisfaction Problem Parameterized Above Average Has a Kernel with a Quadratic Number of Variables, Journal of Computer and System Sciences, 78, pp. 151-163 (2012). Preliminary version in proc. of ESA 2010, LNCS 6346, pp. 326-337. (arXiv)
Katharina Huber, Leo van Iersel, Steven Kelk and Radoslaw Suchecki, A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8 (3), pp. 635-649 (2011).
Leo van Iersel and Steven Kelk, Constructing the Simplest Possible Phylogenetic Network from Triplets, Algorithmica, 60, pp. 207-235 (2011). Preliminary verion in proc. of ISAAC 2008, LNCS 5369, pp. 472-483.
Leo van Iersel, Charles Semple and Mike Steel, Quantifying the Extent of Lateral Gene Transfer Required to Avert a 'Genome of Eden', Bulletin of Mathematical Biology, 72(7), pp. 1783-1798 (2010).
Leo van Iersel, Steven Kelk, Regula Rupp and Daniel Huson, Phylogenetic Networks Do not Need to Be Complex: Using Fewer Reticulations to Represent Conflicting Clusters, Bioinformatics, 26, pp. i124-i131 (2010) (proceedings of ISMB 2010).
Leo van Iersel, Steven Kelk and Matthias Mnich, Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks, Journal of Bioinformatics and Computational Biology, 7 (4), pp. 597-623 (2009).
Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, Ferry Hagen and Teun Boekhout, Constructing Level-2 Phylogenetic Networks from Triplets, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6 (4), pp. 667-681 (2009). Preliminary version in proc. of RECOMB 2008, LNBI 4955, pp. 450-462.
Leo van Iersel, Judith Keijsper, Steven Kelk and Leen Stougie, Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5 (2), pp. 301-312 (2008). Preliminary version in proc. of WABI 2006, LNCS 4175, pp. 80-91.
Cor Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie and John Tromp, Prefix reversals on binary and ternary strings, SIAM Journal on Discrete Mathematics, 21 (3), pp. 592-611 (2007). Preliminary version in proc. of AB 2007, LNCS 4545, pp. 292-306.
Rudi Cilibrasi, Leo van Iersel, Steven Kelk and John Tromp, The Complexity of the Single Individual SNP Haplotyping Problem, Algorithmica, 49 (1), pp. 13-36 (2007). Preliminary version in proc. of WABI 2005, LNCS 3692, pp. 128-139.
CASS: Integrated into Dendroscope. Combines any set of phylogenetic trees into a phylogenetic network representing all clusters of all input trees. CASS uses significanly fewer reticulations than other methods. Paper. User Guide.
LEV1ATHAN: A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks. Combines any set of phylogenetic trees into a level-1 phylogenetic network (a galled tree) that is consistent with a large number of the triplet topologies of the input trees. Paper. Download.
SIMPLISTIC: Constructs level-k phylogenetic networks from triplets. This program always returns a phylogenetic network consistent with all input triplets. Partly based on the SL-k and MINPITS algorithms in this paper. Download.
Talks and Posters
October 2012, The Future of Phylogenetic Networks, Leiden, The Netherlands. A summary of the week (slides).
June 2012, Mathematical and Computational Evolutionary Biology (MCEB), Montpellier, France. Hybridization Networks for Multiple Trees (poster).
April 2012, University of East Anglia, United Kingdom, Minimizing Hybridizations.
January 2012, SOUTH, The 16th Annual New Zealand Phylogenetics Meeting, Kaikoura, New Zealand, Approximating the minimum number of reticulations needed to explain two conflicting gene trees (slides).
January 2012, Gijs de Leve Prijs Reward Lecture, LNMB Conference, Lunteren, Netherlands.
April 2010, Adelaide Phylogenetics Conference, Australia, Phylogenetic networks do not need to be complex.
February 2010, DOOM, The 14th Annual New Zealand Phylogenetics Meeting, Mount Ruapehu, New Zealand, Avoiding a Genome of Eden.
December 2009, TACO workshop on Treewidth and Combinatorial Optimization, Eindhoven University, The Netherlands, Treewidth and the Genome of Eden.
November 2009, Physoc Seminar, University of Canterbury, Christchurch, New Zealand, Using Mathematics to Reconstruct the Evolution of Species.
October 2009, Allan Wilson Centre Meeting, Palmerston North, New Zealand, Phylogenetic Networks Do not Need to Be Complex.
December 2008, International Symposium on Algorithms and Computation (ISAAC 2008), Gold Coast, Australia, Constructing the Simplest Possible Phylogenetic Network from Triplets.
June 2008, Mathematics and Informatics in Evolution and Phylogeny, Montpellier, France, Level-k Phylogenetic Networks.
April 2008, Algorithms seminar, Eindhoven University, The Netherlands, On the Simplicity of Evolution: Algorithms for Phylogenetic Networks.
April 2008, Conference on Research in Computational Molecular Biology (RECOMB 2008), Singapore, Constructing Level-2 Phylogenetic Networks from Triplets.
January 2008, Conference on the Mathematics of Operations Research, Lunteren, The Netherlands, Level-k Phylogenetic Networks: Uniqueness and Complexity.
November 2007, DIAMANT/EIDMA Symposium, Soesterberg, The Netherlands, Constructing Evolutionary Networks from Triplets.
February 2007, EIDMA Seminar Combinatorial Theory, Eindhoven University, The Netherlands, Combinatorial Problems in Genetics.
January 2007, Conference on the Mathematics of Operations Research, Lunteren, The Netherlands, Resolving Ambiguity in Genetical Data.
December 2006, Genome Informatics AG-seminar, Bielefeld, Germany, Sorting pancakes.
October 2006, SIREN 2006 poster presentation, Utrecht, The Netherlands, Computing evolutionary distance by genome rearrangements: a combinatorial approach, Phylogenetic trees for yeasts and Combinatorial approaches in phylogenetics: two examples.
April 2006, Algorithms seminar, Eindhoven University, The Netherlands, Lots of Problems about Strings and Prefix Reversals.
October 2005, Workshop on Algorithms in Bioinformatics 2005, Mallorca, Spain, On the Complexity of Several Haplotyping Problems.
May 2005, EIDMA Seminar Combinatorial Theory, Eindhoven University, The Netherlands, Two Complexity Results in Computational Biology.