Computing the maximum agreement of phylogenetic networks
type: Item
instance of: scholarly article
title: Computing the maximum agreement of phylogenetic networks
zbMATH Open document ID: 1091.68057
author: Charles Choy
author: Jesper Jansson
author: Kunihiko Sadakane
author: Wing-Kin Sung
published in: Theoretical Computer Science
publication date: 2005-06-10T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2174872
zbMATH Keywords: Phylogenetic network comparison
zbMATH Keywords: Maximum agreement subnetwork
zbMATH Keywords: Algorithm
zbMATH Keywords: Computational complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.12.012
OpenAlex ID: W1986316739
Wikidata QID: Q124796611
cites work: Faster exact algorithms for hard problems: A parameterized point of view
cites work: Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
cites work: Constructing Evolutionary Trees in the Presence of Polymorphic Characters
cites work: An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
cites work: Q3619797
cites work: On the agreement of many trees
cites work: Q3128909
cites work: Sparse Dynamic Programming for Evolutionary-Tree Comparison
cites work: Q4198056
cites work: On the complexity of constructing evolutionary trees
cites work: Reconstructing evolution of sequences subject to recombination using parsimony
cites work: On the complexity of comparing evolutionary trees
cites work: Computing and Combinatorics
cites work: Tree Contractions and Evolutionary Trees
cites work: An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
cites work: Q5456778
cites work: Kaikoura tree theorems: Computing the maximum agreement subtree
DOI: 10.1016/J.TCS.2004.12.012
description: scientific article; zbMATH DE number 2174872