Polynomial-time algorithms for phylogenetic inference problems

DOI10.1007/978-3-319-91938-6_4zbMath1392.92065arXiv1802.00317OpenAlexW2963793240MaRDI QIDQ1660113

Y. Aharonov

Publication date: 15 August 2018

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

zbMATH Keywords

polynomial-time algorithmsphylogenetic inference problems

Mathematics Subject Classification ID

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

Related Items (3)

The rigid hybrid number for two phylogenetic trees ⋮ Autopolyploidy, allopolyploidy, and phylogenetic networks with horizontal arcs ⋮ Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances

This page was built for publication: Polynomial-time algorithms for phylogenetic inference problems