An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
type: Item
instance of: scholarly article
title: An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
zbMATH Open document ID: 1259.92077
author: Dan Gusfield
author: Satish Eddhu
author: Dean R. Hickerson
published in: Discrete Applied Mathematics
publication date: 2007-04-18T00:00:00Z
Mathematics Subject Classification ID: 92D15
Mathematics Subject Classification ID: 92C42
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5144485
zbMATH Keywords: molecular evolution
zbMATH Keywords: phylogenetic networks
zbMATH Keywords: ancestral recombination graph
zbMATH Keywords: recombination
zbMATH Keywords: hybridization
zbMATH Keywords: SNP
MaRDI profile type: Publication
full work available at URL: j.dam.2005.05.044
OpenAlex ID: W2033833391
cites work: Research in Computational Molecular Biology
cites work: Efficient algorithms for inferring evolutionary trees
cites work: Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
cites work: The fine structure of galls in phylogenetic networks
cites work: Reconstructing evolution of sequences subject to recombination using parsimony
cites work: Q5456778
cites work: On the minimum number of recombination events in the evolutionary history of DNA se\-quences
DOI: 10.1016/J.DAM.2005.05.044
description: scientific article; zbMATH DE number 5144485