Efficient algorithms for inferring evolutionary trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- On the compatibility of binary qualitative taxonomic characters
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- When are two qualitative taxonomic characters compatible?
Cited in
(72)- Phylogenetic graph models beyond trees
- A new recombination lower bound and the minimum perfect phylogenetic forest problem
- On the complexity of SNP block partitioning under the perfect phylogeny model
- A combinatorial description of the closest tree algorithm for finding evolutionary trees
- Convex tree realizations of partitions
- The complexity of reconstructing trees from qualitative characters and subtrees
- Reconstructing a history of recombinations from a set of sequences
- Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results
- Retractions of finite distance functions onto tree metrics
- Some notes on the combinatorial properties of haplotype tagging
- Recovering trees from well-separated multi-state characters.
- Inferring evolutionary trees with strong combinatorial evidence
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
- The ages of mutations in gene trees
- High-performance algorithm engineering for computational phylogenetics
- PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion
- The matroid structure of representative triple sets and triple-closure computation
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
- Unrooted genealogical tree probabilities in the infinitely-many-sites model
- A polynomial time algorithm for constructing the refined Buneman tree
- Comparison of strings belonging to the same family
- Finding a maximum compatible tree is NP-hard for sequences and trees
- Affine and projective tree metric theorems
- Character-based phylogeny construction and its application to tumor evolution
- Enumeration of binary trees compatible with a perfect phylogeny
- Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting
- On coalescence analysis using genealogy rooted trees
- Most parsimonious likelihood exhibits multiple optima for compatible characters
- Tractability and hardness of flood-filling games on trees
- Unique determination of some homoplasies at hybridization events
- A cubic-vertex kernel for flip consensus tree
- From constrained to unconstrained maximum agreement subtree in linear time
- An algorithm for the maximum likelihood problem on evolutionary trees
- Efficient approximation of convex recolorings
- Evolutionary trees can be learned in polynomial time in the two-state general Markov model
- An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree
- The dual complex of \({\overline{M}_{0,n}}\) via phylogenetics
- Unique perfect phylogeny is NP-hard
- scientific article; zbMATH DE number 5003290 (Why is no real title available?)
- A Covariance Matrix Inversion Problem arising from the Construction of Phylogenetic Trees
- An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
- From Gene Trees to Species Trees through a Supertree Approach
- \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time
- Optimizing tree and character compatibility across several phylogenetic trees
- scientific article; zbMATH DE number 1256738 (Why is no real title available?)
- A simple characterization of the minimal obstruction sets for three-state perfect phylogenies
- Algorithms and Computation
- Two strikes against perfect phylogeny
- Finding a perfect phylogeny from mixed tumor samples
- On a matching distance between rooted phylogenetic trees
- Building species trees from larger parts of phylogenomic databases
- Finding similar consensus between trees: An algorithm and a distance hierarchy
- Inference from gene trees in a subdivided population
- On the complexity of comparing evolutionary trees
- The asymmetric median tree. --- A new model for building consensus trees
- Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks
- Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples
- A Survey on the Complexity of Flood-Filling Games
- An Efficient Coalescent Model for Heterochronously Sampled Molecular Data
- Enumeration of rooted binary perfect phylogenies
- The binary perfect phylogeny with persistent characters
- A colored graph approach to perfect phylogeny with persistent characters
- Unique reconstruction of tree-like phylogenetic networks from distances between leaves
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Incomplete directed perfect phylogeny in linear time
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees
- On the minimum number of topologies explaining a sample of DNA sequences
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
- An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
- Improved approximation algorithm for convex recoloring of trees
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
This page was built for publication: Efficient algorithms for inferring evolutionary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5752379)
