Tree Containment With Soft Polytomies

DOI10.7155/jgaa.00565zbMath1489.05136OpenAlexW3200406594MaRDI QIDQ5084686

Mathias Weller, Matthias Bentert

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• S-Cluster++
• tcp_package

Cites Work

• Unnamed Item
• Unnamed Item
• Reticulation-visible networks
• A decomposition theorem and two algorithms for reticulation-visible networks
• Interval scheduling and colorful independent sets
• Seeing the trees and their branches in the network is hard
• Solving the tree containment problem for reticulation-visible networks in linear time
• Locating a tree in a phylogenetic network
• An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
• Locating a Tree in a Phylogenetic Network in Quadratic Time
• Basic Phylogenetic Combinatorics
• Complexity of automaton identification from given data
• Topology of viral evolution

This page was built for publication: Tree Containment With Soft Polytomies