Fast Compatibility Testing for Rooted Phylogenetic Trees

DOI10.4230/LIPIcs.CPM.2016.12zbMath1380.68483arXiv1510.07758OpenAlexW2738792055MaRDI QIDQ5369546

Yun Deng, David Fernández Baca

Publication date: 17 October 2017

Full work available at URL: https://arxiv.org/abs/1510.07758

zbMATH Keywords

computational biologyphylogenetics

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Problems related to evolution (92D15)

Related Items (5)

Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract) ⋮ The matroid structure of representative triple sets and triple-closure computation ⋮ On compatibility and incompatibility of collections of unrooted phylogenetic trees ⋮ Fast compatibility testing for rooted phylogenetic trees ⋮ Reconstructing gene trees from Fitch's xenology relation

This page was built for publication: Fast Compatibility Testing for Rooted Phylogenetic Trees