The following pages link to Phylogeny (Q2828468):
Displaying 50 items.
- Counting and enumerating galled networks (Q2192120) (← links)
- Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting (Q2194460) (← links)
- Counting and enumerating tree-child networks and their subclasses (Q2194860) (← links)
- Impossibility of consistent distance estimation from sequence lengths under the TKF91 model (Q2202060) (← links)
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808) (← links)
- Phylosymmetric algebras: mathematical properties of a new tool in phylogenetics (Q2227157) (← links)
- Identifiability in phylogenetics using algebraic matroids (Q2229705) (← links)
- Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes (Q2232137) (← links)
- On asymptotic joint distributions of cherries and pitchforks for random phylogenetic trees (Q2232172) (← links)
- Roadblocked monotonic paths and the enumeration of coalescent histories for non-matching caterpillar gene trees and species trees (Q2280357) (← links)
- Phylogenetic networks that are their own fold-ups (Q2280359) (← links)
- Correlation between Shapley values of rooted phylogenetic trees under the beta-splitting model (Q2299260) (← links)
- Combinatorial properties of phylogenetic diversity indices (Q2299262) (← links)
- Embeddability and rate identifiability of Kimura 2-parameter matrices (Q2299271) (← links)
- Level-1 phylogenetic networks and their balanced minimum evolution polytopes (Q2303736) (← links)
- A partial order and cluster-similarity metric on rooted phylogenetic trees (Q2303737) (← links)
- Notes on Markov embedding (Q2310419) (← links)
- Distribution and asymptotic behavior of the phylogenetic transfer distance (Q2313956) (← links)
- Alternative characterizations of Fitch's xenology relation (Q2315209) (← links)
- Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees (Q2322864) (← links)
- Reconciling event-labeled gene trees with MUL-trees and species networks (Q2330637) (← links)
- The optimal rate for resolving a near-polytomy in a phylogeny (Q2402523) (← links)
- Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks (Q2656967) (← links)
- Squaring within the Colless index yields a better balance index (Q2657967) (← links)
- On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees (Q2659064) (← links)
- The rigid hybrid number for two phylogenetic trees (Q2661987) (← links)
- The hybrid number of a ploidy profile (Q2673882) (← links)
- The shape of phylogenies under phase-type distributed times to speciation and extinction (Q2676651) (← links)
- Forest-based networks (Q2676652) (← links)
- Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance (Q2680228) (← links)
- Parsimony and the rank of a flattening matrix (Q2687001) (← links)
- The embedding problem for Markov matrices (Q2687300) (← links)
- Evaluation of the relative performance of the subflattenings method for phylogenetic inference (Q2687719) (← links)
- The agreement distance of unrooted phylogenetic networks (Q3386619) (← links)
- MULTIPLICATIVELY CLOSED MARKOV MODELS MUST FORM LIE ALGEBRAS (Q4608947) (← links)
- Spectral Neighbor Joining for Reconstruction of Latent Tree Models (Q4999349) (← links)
- Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings (Q5014114) (← links)
- Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections (Q5026978) (← links)
- On the Largest Common Subtree of Random Leaf-Labeled Binary Trees (Q5028357) (← links)
- Quantum channel simulation of phylogenetic branching models (Q5052238) (← links)
- Non-binary universal tree-based networks (Q5084706) (← links)
- Upward planar drawings with two slopes (Q5084713) (← links)
- On equal-input and monotone Markov matrices (Q5084792) (← links)
- (Q5088919) (← links)
- Rapidly computing the phylogenetic transfer index (Q5091744) (← links)
- Phylogenetic Networks (Q5118413) (← links)
- A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks (Q5163512) (← links)
- Treewidth of display graphs: bounds, brambles and applications (Q5233142) (← links)
- A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees (Q5233752) (← links)
- On the Balance of Unrooted Trees (Q5856665) (← links)
