scientific article; zbMATH DE number 7238964
From MaRDI portal
Publication:5116473
DOI10.4230/LIPIcs.SWAT.2018.9zbMath1477.68199MaRDI QIDQ5116473
Josef Mallík, Mathias Weller, Matthias Bentert
Publication date: 25 August 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Related Items (3)
Non-essential arcs in phylogenetic networks ⋮ Tree Containment With Soft Polytomies ⋮ On reachable assignments in cycles
Uses Software
Cites Work
- 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
- 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
- Topology of viral evolution
This page was built for publication:
