Solving the tree containment problem for reticulation-visible networks in linear time

DOI10.1007/978-3-319-91938-6_3zbMath1392.92060OpenAlexW2804771780MaRDI QIDQ1660112

Andreas Dwi Maryanto Gunawan

Publication date: 15 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-91938-6_3

zbMATH Keywords

tree containment problemphylogeny reconstructionreticulation-visible

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15)

Related Items (2)

Tree Containment With Soft Polytomies ⋮ Display sets of normal and tree-child networks

This page was built for publication: Solving the tree containment problem for reticulation-visible networks in linear time