Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time
From MaRDI portal
Publication:2798232
DOI10.1007/978-3-319-29516-9_17zbMath1474.68223OpenAlexW2339386068WikidataQ58172944 ScholiaQ58172944MaRDI QIDQ2798232
Louxin Zhang, Philippe Gambette, Anthony Labarre, Andreas Dwi Maryanto Gunawan, Stéphane Vialette
Publication date: 4 April 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-01226035/file/IWOCA2015_genetically_stable%20%281%29.pdf
Analysis of algorithms (68W40) Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10)
Related Items (5)
Linear Time Algorithm for Tree-Child Network Containment ⋮ Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ Solving the tree containment problem in linear time for nearly stable phylogenetic networks ⋮ On cherry-picking and network containment ⋮ A decomposition theorem and two algorithms for reticulation-visible networks
This page was built for publication: Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time
