activity
20052026
most citedOn the Complexity of the Single Individual SNP Haplotyping Problem

57 citations · 110 across the 40 of their papers we have counts for

collaborators
Showing 2017Show all

5 papers · 1 filter

q-bio.PE2017★ 8 cited

Deciding the existence of a cherry-picking sequence is hard on two trees

Janosch Döcker, Leo van Iersel, Steven Kelk +1

Here we show that deciding whether two rooted binary phylogenetic trees on the same set of taxa permit a cherry-picking sequence, a special type of elimination order on the taxa, i…

math.CO2017★ 20 cited

Exploring the tiers of rooted phylogenetic network space using tail moves

Remie Janssen, Mark Jones, Péter L. Erdős +2

Popular methods for exploring the space of rooted phylogenetic trees use rearrangement moves such as rNNI (rooted Nearest Neighbour Interchange) and rSPR (rooted Subtree Prune and…

q-bio.PE2017

Finding the most parsimonious or likely tree in a network with respect to an alignment

Steven Kelk, Fabio Pardi, Celine Scornavacca +1

Phylogenetic networks are often constructed by merging multiple conflicting phylogenetic signals into a directed acyclic graph. It is interesting to explore whether a network const…

q-bio.PE2017

Binets: fundamental building blocks for phylogenetic networks

Leo van Iersel, Vincent Moulton, Eveline de Swart +1

Phylogenetic networks are a generalization of evolutionary trees that are used by biologists to represent the evolution of organisms which have undergone reticulate evolution. Esse…

math.CO2017★ 3 cited

Leaf-reconstructibility of phylogenetic networks

Leo van Iersel, Vincent Moulton

An important problem in evolutionary biology is to reconstruct the evolutionary history of a set of species. This history is often represented as a phylogenetic network, that i…