The following pages link to (Q4792088):
Displaying 50 items.
- The combinatorics of discrete time-trees: theory and open problems (Q96717) (← links)
- Computing nearest neighbour interchange distances between ranked phylogenetic trees (Q96718) (← links)
- Discrete coalescent trees (Q96722) (← links)
- Phylogenetic networks with every embedded phylogenetic tree a base tree (Q257157) (← links)
- On the maximum parsimony distance between phylogenetic trees (Q259724) (← links)
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices (Q263094) (← links)
- Reticulation-visible networks (Q281904) (← links)
- Families of multiweights and pseudostars (Q285916) (← links)
- Kernelizations for the hybridization number problem on multiple nonbinary trees (Q295644) (← links)
- Matrix group structure and Markov invariants in the strand symmetric phylogenetic substitution model (Q304035) (← links)
- Determining phylogenetic networks from inter-taxa distances (Q304036) (← links)
- On joint subtree distributions under two evolutionary models (Q304457) (← links)
- The space of ultrametric phylogenetic trees (Q307584) (← links)
- Some axiomatic limitations for consensus and supertree functions on hierarchies (Q307637) (← links)
- Characterizing local optima for maximum parsimony (Q309903) (← links)
- An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances (Q313792) (← links)
- A branch-price-and-cut algorithm for the minimum evolution problem (Q319451) (← links)
- Phylogenetic invariants for \(\mathbb{Z}_3\) scheme-theoretically (Q331496) (← links)
- Weighted graphs with distances in given ranges (Q333343) (← links)
- Folding and unfolding phylogenetic trees and networks (Q338372) (← links)
- Common fixed points for some generalized multivalued nonexpansive mappings in uniformly convex metric spaces (Q351509) (← links)
- Learning loopy graphical models with latent variables: efficient methods and guarantees (Q355078) (← links)
- Employing common limit range property to prove unified metrical common fixed point theorems (Q355611) (← links)
- A minimax inequality and its applications to fixed point theorems in CAT(0) spaces (Q359784) (← links)
- Identifiability and inference of non-parametric rates-across-sites models on large-scale phylo\-genies (Q376326) (← links)
- Lassoing and corralling rooted phylogenetic trees (Q376433) (← links)
- Reconstruction of certain phylogenetic networks from their tree-average distances (Q383120) (← links)
- Optimizing tree and character compatibility across several phylogenetic trees (Q391984) (← links)
- Tree reconstruction from triplet cover distances (Q405205) (← links)
- Tree cumulants and the geometry of binary tree models (Q408105) (← links)
- Common fixed points for asymptotic pointwise nonexpansive mappings in metric and Banach spaces (Q410933) (← links)
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Constructing circular phylogenetic networks from weighted quartets using simulated annealing (Q423083) (← links)
- Edge contractions in subclasses of chordal graphs (Q423902) (← links)
- The split decomposition of a \(k\)-dissimilarity map (Q432491) (← links)
- An algebraic analysis of the two state Markov model on tripod trees (Q435770) (← links)
- Trees, tight-spans and point configurations (Q442355) (← links)
- `Bureaucratic' set systems, and their role in phylogenetics (Q449344) (← links)
- A simple characterization of the minimal obstruction sets for three-state perfect phylogenies (Q450220) (← links)
- Bounding the maximum size of a minimal definitive set of quartets (Q456077) (← links)
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable (Q476442) (← links)
- Parsimonious cluster systems (Q481907) (← links)
- Reconstructing a phylogenetic level-1 network from quartets (Q486621) (← links)
- Birth-death models and coalescent point processes: the shape and probability of reconstructed phylogenies (Q487319) (← links)
- The combinatorics of tandem duplication (Q494419) (← links)
- On the fixed parameter tractability of agreement-based phylogenetic distances (Q504072) (← links)
- Phase transition on the convergence rate of parameter estimation under an Ornstein-Uhlenbeck diffusion on a tree (Q504087) (← links)
- Comparing and simplifying distinct-cluster phylogenetic networks (Q505705) (← links)
- A characterization of dissimilarity families of trees (Q507573) (← links)
