scientific article; zbMATH DE number 7238964

DOI10.4230/LIPICS.SWAT.2018.9zbMATH Open1477.68199MaRDI QIDQ5116473FDOQ5116473

Josef Mallík, Mathias Weller, Matthias Bentert

Publication date: 25 August 2020

Title of this publication is not available (Why is that?)

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

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)

Cites Work

• 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
• Title not available (Why is that?)
• 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

Cited In (7)

• The watering of tall trees -- embolization and recovery
• Embedding phylogenetic trees in networks of low treewidth
• Non-essential arcs in phylogenetic networks
• Tree containment and degree conditions
• Tree Containment With Soft Polytomies
• Title not available (Why is that?)
• On reachable assignments in cycles

Uses Software

• Algorithm 447
• tcp_package

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)