Leo J. J. van Iersel

PaNDA introduces a polynomial-time algorithm for maximizing phylogenetic diversity in bounded scanwidth networks and extends the concept to semi-directed networks.

This paper shows that certain complex phylogenetic networks are identifiable from DNA sequences under the Jukes-Cantor model, with implications for distinguishing reticulated components.

This paper introduces an algorithm to reconstruct semi-directed phylogenetic level-1 networks from four-leaved networks or sequence alignments, demonstrating its performance on simulated and real data.