Pages that link to "Item:Q5752379"
From MaRDI portal
The following pages link to Efficient algorithms for inferring evolutionary trees (Q5752379):
Displaying 50 items.
- An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree (Q290256) (← links)
- The dual complex of \({\overline{M}_{0,n}}\) via phylogenetics (Q292080) (← links)
- Importance sampling for Lambda-coalescents in the infinitely many sites model (Q299323) (← links)
- \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time (Q378228) (← links)
- Optimizing tree and character compatibility across several phylogenetic trees (Q391984) (← links)
- A simple characterization of the minimal obstruction sets for three-state perfect phylogenies (Q450220) (← links)
- Building species trees from larger parts of phylogenomic databases (Q553332) (← links)
- The binary perfect phylogeny with persistent characters (Q714807) (← links)
- A colored graph approach to perfect phylogeny with persistent characters (Q728267) (← links)
- Unique reconstruction of tree-like phylogenetic networks from distances between leaves (Q743846) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- Incomplete directed perfect phylogeny in linear time (Q832858) (← links)
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees (Q845850) (← links)
- On the minimum number of topologies explaining a sample of DNA sequences (Q851299) (← links)
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species (Q868961) (← links)
- An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study (Q876478) (← links)
- Improved approximation algorithm for convex recoloring of trees (Q927405) (← links)
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727) (← links)
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation (Q990618) (← links)
- Phylogenetic graph models beyond trees (Q1026198) (← links)
- A new recombination lower bound and the minimum perfect phylogenetic forest problem (Q1029702) (← links)
- On the complexity of SNP block partitioning under the perfect phylogeny model (Q1045048) (← links)
- A combinatorial description of the closest tree algorithm for finding evolutionary trees (Q1182982) (← links)
- Convex tree realizations of partitions (Q1195647) (← links)
- The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
- Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results (Q1281782) (← links)
- Retractions of finite distance functions onto tree metrics (Q1283796) (← links)
- Some notes on the combinatorial properties of haplotype tagging (Q1410355) (← links)
- Recovering trees from well-separated multi-state characters. (Q1427476) (← links)
- Inferring evolutionary trees with strong combinatorial evidence (Q1575435) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- The ages of mutations in gene trees (Q1578585) (← links)
- High-performance algorithm engineering for computational phylogenetics (Q1610603) (← links)
- PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion (Q1715640) (← links)
- The matroid structure of representative triple sets and triple-closure computation (Q1746594) (← links)
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination (Q1775773) (← links)
- Unrooted genealogical tree probabilities in the infinitely-many-sites model (Q1804843) (← links)
- A polynomial time algorithm for constructing the refined Buneman tree (Q1808975) (← links)
- Comparison of strings belonging to the same family (Q1818790) (← links)
- Finding a maximum compatible tree is NP-hard for sequences and trees (Q1921170) (← links)
- Affine and projective tree metric theorems (Q1950414) (← links)
- Character-based phylogeny construction and its application to tumor evolution (Q2011627) (← links)
- Enumeration of binary trees compatible with a perfect phylogeny (Q2140024) (← links)
- Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting (Q2194460) (← links)
- On coalescence analysis using genealogy rooted trees (Q2262416) (← links)
- Most parsimonious likelihood exhibits multiple optima for compatible characters (Q2299315) (← links)
- Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
- Unique determination of some homoplasies at hybridization events (Q2426327) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
