Computing the maximum agreement of phylogenetic networks
From MaRDI portal
Publication:1781993
DOI10.1016/j.tcs.2004.12.012zbMath1091.68057OpenAlexW1986316739WikidataQ124796611 ScholiaQ124796611MaRDI QIDQ1781993
Kunihiko Sadakane, Charles Choy, Jesper Jansson, Wing-Kin Sung
Publication date: 10 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.12.012
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters, Classes of explicit phylogenetic networks and their biological and mathematical significance, Encoding and constructing 1-nested phylogenetic networks with trinets, Path lengths in tree-child time consistent hybridization networks, Inferring a level-1 phylogenetic network from a dense set of rooted triplets, Do branch lengths help to locate a tree in a phylogenetic network?, Unrooted non-binary tree-based phylogenetic networks, Fast algorithm for the reconciliation of gene trees and LGT networks, Reconstruction of certain phylogenetic networks from their tree-average distances, Computing consensus networks for collections of 1-nested phylogenetic networks, How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks, Computing the rooted triplet distance between galled trees by counting triangles, Faster computation of the Robinson-Foulds distance between phylogenetic networks, On encodings of phylogenetic networks of bounded level, Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets, Constructing the simplest possible phylogenetic network from triplets, Fast algorithms for computing the tripartition-based distance between phylogenetic networks, All that glisters is not galled, Computing the rooted triplet distance between phylogenetic networks, Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time, The Structure of Level-k Phylogenetic Networks, Novel phylogenetic network distances based on cherry picking
Cites Work
- Reconstructing evolution of sequences subject to recombination using parsimony
- On the complexity of constructing evolutionary trees
- Kaikoura tree theorems: Computing the maximum agreement subtree
- On the agreement of many trees
- An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
- An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
- Tree Contractions and Evolutionary Trees
- Constructing Evolutionary Trees in the Presence of Polymorphic Characters
- Sparse Dynamic Programming for Evolutionary-Tree Comparison
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
- Computing and Combinatorics
- Faster exact algorithms for hard problems: A parameterized point of view
- On the complexity of comparing evolutionary trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
