Computing the maximum agreement of phylogenetic networks
From MaRDI portal
Recommendations
Cites work
- An \(O(n\log 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
- Computing and Combinatorics
- Constructing Evolutionary Trees in the Presence of Polymorphic Characters
- Faster exact algorithms for hard problems: A parameterized point of view
- scientific article; zbMATH DE number 1003280 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Kaikoura tree theorems: Computing the maximum agreement subtree
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
- On the agreement of many trees
- On the complexity of comparing evolutionary trees
- On the complexity of constructing evolutionary trees
- Reconstructing evolution of sequences subject to recombination using parsimony
- Sparse Dynamic Programming for Evolutionary-Tree Comparison
- Towards the development of computational tools for evaluating phylogenetic network reconstruction methods
- Tree Contractions and Evolutionary Trees
Cited in
(34)- Finding a most parsimonious or likely tree in a network with respect to an alignment
- Novel phylogenetic network distances based on cherry picking
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
- On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Fast algorithm for the reconciliation of gene trees and LGT networks
- Computing the rooted triplet distance between galled trees by counting triangles
- Unrooted non-binary tree-based phylogenetic networks
- Computing the maximum agreement of phylogenetic networks
- Scanning phylogenetic networks is NP-hard
- Do branch lengths help to locate a tree in a phylogenetic network?
- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
- The Structure of Level-k Phylogenetic Networks
- Reconstruction of certain phylogenetic networks from their tree-average distances
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
- 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
- On computing the maximum parsimony score of a phylogenetic network
- Constructing the simplest possible phylogenetic network from triplets
- Algorithms and Computation
- Computing the rooted triplet distance between phylogenetic networks
- Computing consensus networks for collections of 1-nested phylogenetic networks
- Finding agreement cherry-reduced subnetworks in level-1 networks
- How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks
- Agreement forests of caterpillar trees: complexity, kernelization and branching
- Finding maximum common contractions between phylogenetic networks
- Bounding the SNPR distance between two tree-child networks using generalised agreement forests
- All that glisters is not galled
- Path lengths in tree-child time consistent hybridization networks
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
- Fast algorithms for computing the tripartition-based distance between phylogenetic networks
This page was built for publication: Computing the maximum agreement of phylogenetic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781993)
