scientific article; zbMATH DE number 7238964

DOI10.4230/LIPICS.SWAT.2018.9MaRDI QIDQ5116473zbMATH OpenFDO

Authors Matthias Bentert, Josef Mallík, Mathias Weller

Publication date 25 August 2020

zbMATH Keywords

phylogeneticsreticulation-visible networksmultifurcating trees

Mathematics Subject Classification ID

Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Tree containment with soft polytomies
• Tree containment and degree conditions
• scientific article; zbMATH DE number 756707
• On soft trees
• Fully dynamic arboricity maintenance
• Fully dynamic arboricity maintenance

Cites work

• A decomposition theorem and two algorithms for reticulation-visible networks
• An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
• Locating a tree in a phylogenetic network
• Locating a tree in a phylogenetic network in quadratic time
• ReCombinatorics. The algorithmics of ancestral recombination graphs and explicit phylogenetic networks. With contributions from Charles H. Langley, Yun S. Song and Yufeng Wu
• Reticulation-visible networks
• Seeing the trees and their branches in the network is hard
• Topology of viral evolution

Cited in

(7)

• Tree containment with soft polytomies
• The watering of tall trees -- embolization and recovery
• Non-essential arcs in phylogenetic networks
• Embedding phylogenetic trees in networks of low treewidth
• Tree containment and degree conditions
• scientific article; zbMATH DE number 756707 (Why is no real title available?)
• On reachable assignments in cycles

Describes a project that uses

Uses Software

• tcp_package
• Algorithm 447

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116473)