On the complexity of computing the temporal hybridization number for two phylogenies
type: Item
instance of: scholarly article
title: On the complexity of computing the temporal hybridization number for two phylogenies
zbMATH Open document ID: 1318.92038
author: Simone Linz
author: Charles Semple
author: Peter J. Humphries
published in: Discrete Applied Mathematics
publication date: 2013-04-25T00:00:00Z
Mathematics Subject Classification ID: 92D15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6157650
zbMATH Keywords: agreement forest
zbMATH Keywords: APX-hard
zbMATH Keywords: phylogenetic network
zbMATH Keywords: phylogenetic tree
zbMATH Keywords: temporal network
describes a project that uses: HybridNET
MaRDI profile type: Publication
full work available at URL: j.dam.2012.11.022
OpenAlex ID: W1988903798
cites work: Bounding the number of hybridisation events for a consistent evolutionary history
cites work: Computing the minimum number of hybridization events for a consistent evolutionary history
cites work: Fundamentals of Computation Theory
cites work: When two trees go to war
cites work: Constructing the simplest possible phylogenetic network from triplets
cites work: Analyzing and reconstructing reticulation networks under timing constraints
cites work: Q3221403
cites work: Optimization, approximation, and complexity classes
cites work: Q4792088
DOI: 10.1016/J.DAM.2012.11.022
description: scientific article; zbMATH DE number 6157650