Steven Kelk's homepage
Since February 2011 I am Assistant Professor at the Department of Knowledge
Engineering (DKE) at Maastricht University in the Netherlands, where I work within the Networks and Strategic Optimization (NSO) cluster. My
contact details are here.
Between 2004 and 2010 I was a postdoc in the Life Sciences cluster of the Centrum voor
Wiskunde en Informatica (CWI) in Amsterdam, in the subgroup Combinatorial
Problems in Biology. I obtained my PhD in late 2003 from the Algorithms and Computational
Complexity Research Group at the University of Warwick. My supervisor was
Leslie Goldberg. My main research
interests are approximation algorithms, phylogenetic networks, graph
theory, fixed parameter tractability and (more generally) combinatorial
within computational biology.
Outside university I am active on issues relating to
public services, particularly housing and education, and I am a
board member of Housing Association
Please note: this website was migrated from my old CWI webpage in March
2011. Not all files have been transferred, so if you
cannot find something (and have already tried changing the prefix of the URL to http://skelk.sdf-eu.org/) don't hesitate to get
in touch with me.
Maastricht students: I am also available for bachelor and masters
projects, see these slides for the
possible themes (and this
page for past graduation
The Future of Phylogenetic Networks
15 – 19 October 2012
Follow-up in July 2014! Click image below:
- Leo van Iersel (Amsterdam)
- Steven Kelk (Maastricht)
- David Morrison (Uppsala)
- Leen Stougie (Amsterdam)
(See also the website of my co-authors Leo van Iersel and Celine
A practical approximation
algorithm for solving
massive instances of hybridization number, Leo van Iersel, Steven
Nela Lekic and Celine Scornavacca, may 2012. To appear in WABI 2012. The
CycleKiller can be downloaded here.
Cycle killer...qu'est-ce que
c'est? On the comparative
approximability of hybridization number and directed feedback vertex
Steven Kelk, Leo van Iersel, Nela Lekic, Simone Linz, Celine
Scornavacca, Leen Stougie, december 22nd 2011. To appear in SIAM
Journal on Discrete Mathematics (SIDMA).
A note on efficient
computation of hybridization number via softwired
clusters, Steven Kelk, august 2011.
phylogenetic networks from softwired
clusters is fixed parameter tractable, Steven Kelk and Celine
august 2011. To appear in Algorithmica, link.
Book review: Phylogenetic
Networks: Concepts, Algorithms and
Applications, Steven Kelk, Systematic Biology 2011; doi:
Algorithmic aspects of
phylogenetic network construction - these are slides (in PDF) from a
talk I gave in April 2011 at the IPA
Lentedagen in the Netherlands.
On the elusiveness of
clusters, Steven Kelk and Celine
Scornavacca and Leo van Iersel, IEEE/ACM Transactions on Computational
Biology and Bioinformatics (TCBB) 9(2) (March-April 2012), pp. 517-534.
When two trees
go to war, Leo van Iersel and Steven Kelk,
Journal of Theoretical Biology 269 (2011), pp. 245-255.
A short note on the tractability of constructing phylogenetic networks from clusters,
Leo van Iersel and Steven Kelk, arXiv pre-print 22 december 2009.
A Practical Algorithm for Reconstructing Level-1 Phylogenetic
Networks, Katharina T. Huber, Leo van Iersel, Steven Kelk, Radoslaw
Suchecki, IEEE/ACM Transactions on Computational Biology and
Bioinformatics (TCBB) 8(3) (May-June 2011), pp. 635-649.
- Satisfying ternary
permutation constraints by multiple linear orders
or phylogenetic trees, Leo van Iersel, Steven Kelk, Nela Lekic and
Simone Linz (October 9th 2014). Submitted.
- The agreement problem for
unrooted phylogenetic trees is FPT,
Celine Scornavacca, Leo van Iersel, Steven Kelk, and David Bryant (June 2014),
to appear in Journal of Graph Algorithms and Applications (JGAA).
- On the challenge of reconstructing level-1 phylogenetic networks from
triplets and clusters, Philippe Gambette, Katharina Huber, Steven Kelk,
march 26th 2014, submitted.
- On low treewidth graphs and
supertrees, Alexander Grigoriev, Steven
Kelk and Nela Lekic, 11th february 2014. To appear in conference
- Hybridization Number on Three
Trees, Leo van Iersel, Steven Kelk, Nela
Lekic, Chris Whidden and Norbert Zeh, 7th february 2014, submitted.
- On the Maximum Parsimony
distance between phylogenetic trees,
Mareike Fischer and Steven Kelk, Submitted, 17th december 2013, to
appear in Annals of Combinatorics (2014).
A short note on exponential-time
algorithms for hybridization number, Leo van Iersel, Steven Kelk, Nela Lekic, Leen Stougie, 4
- A practical
approximation algorithm for solving
massive instances of hybridization number for
binary and nonbinary trees, Leo van Iersel, Nela Lekic, Celine
Scornavacca, November 2013, BMC Bioinformatics (2014).
- This is the journal version of the WABI 2012 paper. We have
extended it to nonbinary trees.
- Kernelizations for the
hybridization number problem on multiple nonbinary trees, Leo van
Iersel and Steven Kelk, 16th November 2013. Submitted, conference version
to appear in WG 2014.
- Fighting network space: it is
time for an SQL-type language to filter
phylogenetic networks, Steven Kelk, Simone Linz, and David A.
October 2013 (unpublished opinion piece, arXiv).
- Exact reconciliation of undated trees. Leo van Iersel, Celine
Scornavacca and Steven Kelk, september 2013 (submitted).
See the accompanying software ILPEACE.
dispersal of the human fungal pathogen Cryptococcus gattii
from the Amazon rainforest, Hagen et. al., PLOS ONE, June 2013. (Link
- Recent advances in rooted phylogenetic networks: the
long road to explicit hypothesis generation. Talk
at conference Mathematical and Computational Evolutionary Biology (MCEB
- Bapteste, E., van Iersel, L. Janke, A., Kelchner, S., Kelk, S.,
McInerney, J.O., Morrison, D.A., Nakhleh, L., Steel, M., Stougie, L. and
Whitfield, J. (2013). Networks:
Expanding evolutionary thinking. Trends in
Genetics (in press).
- On Computing The Maximum
Parsimony Score Of A Phylogenetic
Network, Mareike Fischer, Leo van Iersel, Steven Kelk, Celine
arxiv (11 feb 2013). Submitted.
- See also the accompanying software MPNet.
- Approximation algorithms for
nonbinary agreement forests, to appear in SIDMA (2014). This extends
the article 'Computing nonbinary agreement forests' by including results for MAAF (and not just MAF).
- Computing nonbinary agreement
Leo van Iersel, Steven Kelk, Nela Lekic and Leen Stougie, arXiv (2012)
- See also the MAF
software on Leo's webpage.
mathematical optimization can, and cannot do, for biologists -
presentation at the Lorentz workshop on the Future of Phylogenetic
Networks (October 2012).
flux spaces of genome-scale stoichiometric models are
determined by a few subnetworks, Steven Kelk, Brett Olivier, Leen
Frank Bruggeman, Nature Scientific Reports 2, 580; DOI:10.1038/srep00580
- Towards the fixed parameter
tractability of constructing minimal
phylogenetic networks from arbitrary sets of nonbinary trees,
Steven Kelk and Celine Scornavacca, 30th July 2012. Submitted.
- A simple fixed
parameter tractable algorithm for
computing the hybridization number of two (not
necessarily binary) trees, Teresa Piovesan and Steven Kelk,
July 25th 2012. To appear in IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB).
- There is an experimental implementation of this algorithm here: TERMINUSEST. Update 9th September 2013: I
have just released Version 2 of TerminusEst, which is much faster
than the original version when hashing is switched on.
Phylogenetic Networks Do
not Need to Be Complex: Using Fewer Reticulations to Represent
Conflicting Clusters, Leo van Iersel, Steven Kelk, Regula Rupp,
Daniel Huson, arXiv pre-print 16 october 2009. March 2010: Accepted to ISMB2010, thereafter to
appear in Bioinformatics 2010
- LEV1ATHAN, the algorithm from the above paper, is available for download from this website.
Some mathematical refinements
concerning error minimization in the genetic code, Harry Buhrman,
Peter T. S. van der Gulik, Steven M. Kelk, Wouter M. Koolen, Leen Stougie,
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
8(5) (Sept-Oct 2011) pp. 1358-1372.
An early release of SIMPLISTIC (SIMPLe network heurISTIC) is now
available! SIMPLISTIC is a program, written in Java, which always returns some network consistent with 100% of the
dense input triplets. See this page for code
and documentation (28 july 2008). There is a poster here about SIMPLISTIC (and MARLON.)
Constructing the Simplest Possible Phylogenetic Network from
Triplets, Leo van Iersel and Steven Kelk, Algorithmica, 60, pp.
207-235 (2011). (Available on-line)
- CASS, the algorithm from the above paper, has now been
incorporated into Dendroscope.
CASS also has its own website, see here.
Uniqueness, intractability and
exact algorithms: reflections on level-k phylogenetic networks,
Leo van Iersel, Steven Kelk, Matthias Mnich,
Journal of Bioinformatics and Computational Biology (JBCB) 7(4):597-623 (2009)
Worst-case optimal approximation algorithms for maximizing
triplet consistency within phylogenetic networks, Jaroslaw Byrka,
Pawel Gawrychowski, Katharina T. Huber, Journal of Discrete Algorithms 8(1):65-75 (2010)
phylogenetic networks from triplets,
Leo van Iersel, Judith
Keijsper, Steven Kelk, Leen Stougie, Ferry Hagen, Teun Boekhout,
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6(4):667-681 (2009).
- MARLON (Minimum Amount of Reticulation
Level One Network) can be downloaded here.
- A version of the paper has been accepted to appear in ISAAC2008.
Shorelines of islands of tractability:
for parsimony and perfect phylogeny haplotyping problems, Leo van Iersel, Judith
Keijsper, Steven Kelk and Leen Stougie, IEEE/ACM Transactions on
Computational Biology and Bioinformatics April-June 2008 (Vol. 5, No. 2)
pp. 301-312. This is the journal version of the WABI paper
Beaches... and contains new approximation
results for PH and MPPH not found in the WABI version. The essence of the approximation results
is explained in this presentation given at Bielefeld University (Germany)
in November 2006.
Beaches of islands of tractability: Algorithms for parsimony
and minimum perfect phylogeny haplotyping problems, Leo van Iersel, Judith Keijsper,
Steven Kelk and Leen Stougie. A conference version was presented at
WABI2006. (WABI slides are available here.)
Prefix reversals on binary and ternary strings,
Cor Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp,
SIAM Journal on Discrete Mathematics, 21(3), pp. 592--611 (2007).
On the complexity of the Single Individual SNP Haplotyping
Problem, Rudi Cilibrasi, Leo van Iersel, Steven Kelk and John Tromp,
Algorithmica 49(1), pp. 13-36 (2007), DOI
On the complexity of several haplotyping problems, Rudi
Cilibrasi, Leo van
Iersel, Steven Kelk and John Tromp, Algorithms in Bioinformatics: 5th International Workshop, WABI 2005,
Mallorca, Spain, October 3-6, 2005, LNCS 3692 / 2005, pp. 128-139.
On the relative complexity of
approximately counting H-colourings, Steven Kelk, PhD Thesis, University of Warwick, 2004.
complexity of choosing an H-colouring (nearly) uniformly at random, L.A. Goldberg, S.
Kelk and M. Paterson, SICOMP, 33(2) 416-432 (2004) copyright SIAM (preliminary version
- Powerpoint slides used in
presentations at University of East Anglia and University of Liverpool,
- September 2007: Here is a practical implementation of the algorithm in Java: LEVEL2
- December 2007: The article has been accepted to appear in RECOMB2008.
Links to books (etc.) about phylogenetic networks
Software for phylogenetic networks
Miscellaneous scientific links
Miscellaneous political links
Last updated: 9th October, 2014.