Locating a Tree in a Phylogenetic Network in Quadratic Time
From MaRDI portal
Publication:2814579
DOI10.1007/978-3-319-16706-0_12zbMath1355.92075arXiv1502.03379OpenAlexW1935971127WikidataQ58172951 ScholiaQ58172951MaRDI QIDQ2814579
Philippe Gambette, Louxin Zhang, Anthony Labarre, Andreas Dwi Maryanto Gunawan, Stéphane Vialette
Publication date: 22 June 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.03379
Problems related to evolution (92D15) Applications of graph theory (05C90) Taxonomy, cladistics, statistics in mathematical biology (92B10) Computational methods for problems pertaining to biology (92-08)
Related Items (12)
Reticulation-visible networks ⋮ Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ Solving the tree containment problem in linear time for nearly stable phylogenetic networks ⋮ Tree Containment With Soft Polytomies ⋮ Bounding the number of reticulations in a tree-child network that displays a set of trees ⋮ Counting and enumerating galled networks ⋮ Counting and enumerating tree-child networks and their subclasses ⋮ Finding a most parsimonious or likely tree in a network with respect to an alignment ⋮ Size of a phylogenetic network ⋮ Phylogenetic networks that are their own fold-ups ⋮ A decomposition theorem and two algorithms for reticulation-visible networks ⋮ Unnamed Item
Cites Work
This page was built for publication: Locating a Tree in a Phylogenetic Network in Quadratic Time