Tree containment with soft polytomies
From MaRDI portal
Publication:5084686
DOI10.7155/JGAA.00565zbMATH Open1489.05136OpenAlexW3200406594MaRDI QIDQ5084686FDOQ5084686
Authors: Matthias Bentert, Mathias Weller 
Publication date: 28 June 2022
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00565
Recommendations
- scientific article; zbMATH DE number 7238964
- Locating a tree in a phylogenetic network
- Solving the tree containment problem for genetically stable networks in quadratic time
- Solving the tree containment problem for reticulation-visible networks in linear time
- Solving the tree containment problem in linear time for nearly stable phylogenetic networks
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Basic phylogenetic combinatorics.
- Locating a tree in a phylogenetic network
- Locating a tree in a phylogenetic network in quadratic time
- Reticulation-visible networks
- Topology of viral evolution
- Seeing the trees and their branches in the network is hard
- Complexity of automaton identification from given data
- ReCombinatorics. The algorithmics of ancestral recombination graphs and explicit phylogenetic networks. With contributions from Charles H. Langley, Yun S. Song and Yufeng Wu
- An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
- A decomposition theorem and two algorithms for reticulation-visible networks
- Interval scheduling and colorful independent sets
- Solving the tree containment problem for reticulation-visible networks in linear time
- Title not available (Why is that?)
Cited In (5)
Uses Software
This page was built for publication: Tree containment with soft polytomies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084686)
