scientific article; zbMATH DE number 7238964
From MaRDI portal
Publication:5116473
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
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)
Uses Software
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)