A decomposition theorem and two algorithms for reticulation-visible networks
From MaRDI portal
Publication:729819
DOI10.1016/j.ic.2016.11.001zbMath1361.92053OpenAlexW2548296792MaRDI QIDQ729819
Louxin Zhang, Andreas Dwi Maryanto Gunawan, Bhaskar Das Gupta
Publication date: 22 December 2016
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2016.11.001
phylogenetic networkstree containment problemcluster containment problemgalled networksreticulation-visibility
Related Items (12)
Solving the tree containment problem in linear time for nearly stable phylogenetic networks ⋮ The Sackin index of simplex 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 ⋮ Display sets of normal and tree-child networks ⋮ When is a phylogenetic network simply an amalgamation of two trees? ⋮ Phylogenetic networks that are their own fold-ups ⋮ Dynamic Dominators and Low-High Orders in DAGs ⋮ Unnamed Item ⋮ Displaying trees across two phylogenetic networks
Cites Work
- Unnamed Item
- Reticulation-visible networks
- Phylogenetic networks that display a tree twice
- Seeing the trees and their branches in the network is hard
- Locating a tree in a phylogenetic network
- Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time
- Locating a Tree in a Phylogenetic Network in Quadratic Time
- Counting Trees in a Phylogenetic Network Is \#P-Complete
- Fast Algorithms for Finding Nearest Common Ancestors
- A fast algorithm for finding dominators in a flowgraph
- Topology of viral evolution
- Fixed-Parameter Algorithms for Finding Agreement Supertrees
- Lowest common ancestors in trees and directed acyclic graphs
This page was built for publication: A decomposition theorem and two algorithms for reticulation-visible networks
