The following pages link to (Q4304358):
Displaying 15 items.
- The reconstructed tree in the lineage-based model of protracted speciation (Q154193) (← links)
- Reconstructing evolution of sequences subject to recombination using parsimony (Q584109) (← links)
- Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic mod\-els (Q948746) (← links)
- A combinatorial description of the closest tree algorithm for finding evolutionary trees (Q1182982) (← links)
- On the number of non-equivalent ancestral configurations for matching gene trees and species trees (Q1736937) (← links)
- The number of evolutionary steps on random and minimum length trees for random evolutionary data (Q1803904) (← links)
- Exact enumeration of cherries and pitchforks in ranked trees under the coalescent model (Q1950226) (← links)
- Combinatorial views on persistent characters in phylogenetics (Q2182613) (← links)
- The probability distribution of the reconstructed phylogenetic tree with occurrence data (Q2294458) (← links)
- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations (Q3506937) (← links)
- (Q3562783) (← links)
- (Q3980809) (← links)
- (Q5405464) (← links)
- Book review of: D. Gusfield, ReCombinatorics. The algorithmics of ancestral recombination graphs and explicit phylogenetic networks (Q5890694) (← links)
- Asymptotic enumeration, global structure, and constrained evolution (Q5931454) (← links)
