A new recombination lower bound and the minimum perfect phylogenetic forest problem
type: Item
instance of: scholarly article
title: A new recombination lower bound and the minimum perfect phylogenetic forest problem
zbMATH Open document ID: 1260.92094
author: Dan Gusfield
author: Yu-Feng Wu
published in: Journal of Combinatorial Optimization
publication date: 2009-07-13T00:00:00Z
Mathematics Subject Classification ID: 92D15
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 5577762
zbMATH Keywords: lower bound on the minimum number of recombination
zbMATH Keywords: ancestral recombination graph
zbMATH Keywords: population genetics
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: s10878-007-9129-6
OpenAlex ID: W2594198741
cites work: On the computational complexity of the rooted subtree prune and regraft distance
cites work: The Steiner problem in phylogeny is NP-complete
cites work: Q4198056
cites work: Efficient algorithms for inferring evolutionary trees
cites work: An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
cites work: Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations
DOI: 10.1007/S10878-007-9129-6
description: scientific article; zbMATH DE number 5577762