activity
20112026
most citedExploring the tiers of rooted phylogenetic network space using tail moves

20 citations · 63 across the 23 of their papers we have counts for

collaborators
Showing cs.DSShow all

7 papers · 1 filter

cs.DS2026

Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility

Leo van Iersel, Mark Jones, Jannik Schestag +2

We investigate parameterized algorithms for computing the average-tree phylogenetic diversity (APD) in rooted phylogenetic networks, studying the problem under different structural…

cs.DS2019★ 12 cited

Generation of Tree-Child phylogenetic networks

Gabriel Cardona, Joan Carles Pons, Celine Scornavacca

Phylogenetic networks generalize phylogenetic trees by allowing the modelization of events of reticulate evolution. Among the different kinds of phylogenetic networks that have bee…

cs.DS2018

An time Algorithm for computing the Path-length Distance between Trees

David Bryant, Celine Scornavacca

Tree comparison metrics have proven to be an invaluable aide in the reconstruction and analysis of phylogenetic (evolutionary) trees. The path-length distance between trees is a pa…

cs.DS2017

Constructing a Consensus Phylogeny from a Leaf-Removal Distance

Cedric Chauve, Mark Jones, Manuel Lafond +2

Understanding the evolution of a set of genes or species is a fundamental problem in evolutionary biology. The problem we study here takes as input a set of trees describing {possi…

cs.DS2016

On the Weighted Quartet Consensus problem

Manuel Lafond, Céline Scornavacca

In phylogenetics, the consensus problem consists in summarizing a set of phylogenetic trees that all classify the same set of species into a single tree. Several definitions of con…

cs.DS2016

Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees

Julien Baste, Christophe Paul, Ignasi Sau +1

In phylogenetics, a central problem is to infer the evolutionary relationships between a set of species ; these relationships are often depicted via a phylogenetic tree -- a tre…

cs.DS2014

Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets

Katharina Huber, Leo van Iersel, Vincent Moulton +2

Binets and trinets are phylogenetic networks with two and three leaves, respectively. Here we consider the problem of deciding if there exists a binary level-1 phylogenetic network…