The following pages link to (Q4792088):
Displaying 50 items.
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets (Q513300) (← links)
- Size of a phylogenetic network (Q516840) (← links)
- Discriminative measures for comparison of phylogenetic trees (Q516872) (← links)
- Phylogenetic mixtures and linear invariants for equal input models (Q527278) (← links)
- Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions (Q528547) (← links)
- The sum of the distances between the leaves of a tree and the `semi-regular' property (Q539876) (← links)
- Experiments with the site frequency spectrum (Q542030) (← links)
- The neighbor-net algorithm (Q550258) (← links)
- Building species trees from larger parts of phylogenomic databases (Q553332) (← links)
- A generalization of Suzuki's Lemma (Q554951) (← links)
- Majority-rule (+) consensus trees (Q608873) (← links)
- Strong convergence of modified Halpern iterations in \(\mathrm{CAT}(0)\) spaces (Q623571) (← links)
- Graph triangulations and the compatibility of unrooted phylogenetic trees (Q628277) (← links)
- Comparing and aggregating partially resolved trees (Q650896) (← links)
- Slim sets of binary trees (Q654890) (← links)
- Split decomposition over an Abelian group. I: Generalities (Q659783) (← links)
- The link between segregation and phylogenetic diversity (Q662584) (← links)
- Geometry of phylogenetic group-based models (Q663592) (← links)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- On the information content of discrete phylogenetic characters (Q667690) (← links)
- Recovering normal networks from shortest inter-taxa distance information (Q667692) (← links)
- Phase transition in the sample complexity of likelihood-based phylogeny inference (Q682796) (← links)
- Robustness analysis of leader-follower consensus for multi-agent systems characterized by double integrators (Q694799) (← links)
- Peeling phylogenetic `oranges' (Q705231) (← links)
- On the maximum size of minimal definitive quartet sets (Q708423) (← links)
- Global alignment of molecular sequences via ancestral state reconstruction (Q713206) (← links)
- Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture (Q718865) (← links)
- Fast compatibility testing for rooted phylogenetic trees (Q724246) (← links)
- A note on convex characters, Fibonacci numbers and exponential-time algorithms (Q730310) (← links)
- Phylogenetic diversity and the maximum coverage problem (Q735104) (← links)
- There are no caterpillars in a wicked forest (Q736334) (← links)
- The Buneman index via polyhedral split decomposition (Q741127) (← links)
- Lie geometry of \(2\times 2\) Markov matrices (Q745046) (← links)
- Rayleigh processes, real trees, and root growth with re-grafting (Q816985) (← links)
- Compatibility of unrooted phylogenetic trees is FPT (Q820142) (← links)
- Approximating common fixed points of a family of non-self mappings in CAT(0) spaces (Q825019) (← links)
- Markovian log-supermodularity, and its applications in phylogenetics (Q845658) (← links)
- A Hall-type theorem for triplet set systems based on medians in trees (Q847268) (← links)
- On the variational distance of two trees (Q862218) (← links)
- Using the tangle: A consistent construction of phylogenetic distance matrices for quartets (Q868196) (← links)
- Computing the minimum number of hybridization events for a consistent evolutionary history (Q881571) (← links)
- R-LINE: a better randomized 2-server algorithm on the line (Q888438) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees (Q897856) (← links)
- Modeling the evolution space of breakage fusion bridge cycles with a stochastic folding process (Q907112) (← links)
- Enhanced negative type for finite metric trees (Q924649) (← links)
- Improved approximation algorithm for convex recoloring of trees (Q927405) (← links)
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727) (← links)
- A regular decomposition of the edge-product space of phylogenetic trees (Q931834) (← links)
- Encoding phylogenetic trees in terms of weighted quartets (Q938146) (← links)
