Export Publications

Export the displayed publications:
Number of documents

13

Publications


"Leo Van Iersel"   

Journal articles12 documents

  • Steven Kelk, Fabio Pardi, Celine Scornavacca, Leo van Iersel. Finding a most parsimonious or likely tree in a network with respect to an alignment. Journal of Mathematical Biology, Springer Verlag (Germany), 2019, 78 (1-2), pp.527-547. ⟨10.1007/s00285-018-1282-2⟩. ⟨lirmm-01964467⟩
  • Leo van Iersel, Mark Jones, Celine Scornavacca. Improved Maximum Parsimony Models for Phylogenetic Networks. Systematic Biology, Oxford University Press (OUP), 2018, 67 (3), pp.518-542. ⟨10.1093/sysbio/syx094⟩. ⟨hal-02154860⟩
  • Remie Janssen, Mark Jones, Péter Erdős, Leo van Iersel, Celine Scornavacca. Exploring the Tiers of Rooted Phylogenetic Network Space Using Tail Moves. Bulletin of Mathematical Biology, Springer Verlag, 2018, 80 (8), pp.2177-2208. ⟨10.1007/s11538-018-0452-0⟩. ⟨hal-02154852⟩
  • Katharina Huber, Leo van Iersel, Vincent Moulton, Celine Scornavacca, Taoyang Wu. Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets. Algorithmica, Springer Verlag, 2017, 77 (1), pp.173-200. ⟨10.1007/s00453-015-0069-8⟩. ⟨hal-02154892⟩
  • Philippe Gambette, Leo van Iersel, Mark Jones, Manuel Lafond, Fabio Pardi, et al.. Rearrangement Moves on Rooted Phylogenetic Networks. PLoS Computational Biology, Public Library of Science, 2017, 13 (8), pp.e1005611. ⟨10.1371/journal.pcbi.1005611⟩. ⟨hal-01572624v2⟩
  • Philippe Gambette, Leo van Iersel, Steven Kelk, Fabio Pardi, Celine Scornavacca. Do branch lengths help to locate a tree in a phylogenetic network?. Bulletin of Mathematical Biology, Springer Verlag, 2016, 78 (9), pp.1773-1795. ⟨10.1007/s11538-016-0199-4⟩. ⟨hal-01372824⟩
  • Leo van Iersel, Steven Kelk, Celine Scornavacca. Kernelizations for the hybridization number problem on multiple nonbinary trees. Journal of Computer and System Sciences, Elsevier, 2016, 82 (6), pp.1075-1089. ⟨10.1016/j.jcss.2016.03.006⟩. ⟨hal-02154926⟩
  • Steven Kelk, Leo van Iersel, Celine Scornavacca, Mathias Weller. Phylogenetic incongruence through the lens of Monadic Second Order logic. Journal of Graph Algorithms and Applications (JGAA), Brown University, 2016, 20 (2), pp.189-215. ⟨10.7155/jgaa.00390⟩. ⟨lirmm-01348425⟩
  • Thu-Hien To, Edwin Jacox, Vincent Ranwez, Mareike Fischer, Leo van Iersel, et al.. On Computing the Maximum Parsimony Score of a Phylogenetic Network. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2015, 29 (1), pp.559-585. ⟨10.1137/140959948⟩. ⟨hal-02154929⟩
  • Celine Scornavacca, Leo Van Iersel, Steven Kelk, David Bryant. The agreement problem for unrooted phylogenetic trees is FPT. Journal of Graph Algorithms and Applications (JGAA), Brown University, 2014, 18 (3), pp.385-392. ⟨10.7155/jgaa.00327⟩. ⟨hal-02154951⟩
  • Leo Van Iersel, Steven Kelk, Nela Lekić, Celine Scornavacca. A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees. BMC Bioinformatics, BioMed Central, 2014, 15 (1), pp.296-302. ⟨10.1186/1471-2105-15-127⟩. ⟨hal-02154944⟩
  • Steven Kelk, Leo van Iersel, Nela Lekic, Simone Linz, Celine Scornavacca, et al.. 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, Society for Industrial and Applied Mathematics, 2012, 26 (4), pp.1635-1656. ⟨hal-00765019⟩

Conference papers1 document

  • Leo Van Iersel, Steven Kelk, Nela Lekić, Celine Scornavacca. A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees. WABI, 2012, Ljubljana, Slovenia. pp.430-440. ⟨hal-02155227⟩