Pages that link to "Item:Q1166450"
From MaRDI portal
The following pages link to Branch and bound algorithms to determine minimal evolutionary trees (Q1166450):
Displaying 17 items.
- On joint subtree distributions under two evolutionary models (Q304457) (← links)
- Characterizing local optima for maximum parsimony (Q309903) (← links)
- Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion (Q542000) (← links)
- A tabu search algorithm for maximum parsimony phylogeny inference (Q853081) (← links)
- Edge lengths of trees from sequence data (Q1101042) (← links)
- Branch and bound algorithms to determine minimal evolutionary trees (Q1166450) (← links)
- A combinatorial description of the closest tree algorithm for finding evolutionary trees (Q1182982) (← links)
- Spectral analysis and a closest tree method for genetic sequences (Q1206217) (← links)
- Probabilistic models in cluster analysis (Q1350792) (← links)
- Distributions of cherries for two models of trees (Q1569920) (← links)
- Mathematical properties of the gene duplication cost (Q1732105) (← links)
- Spectral analysis of phylogenetic data (Q1801907) (← links)
- On cherry and pitchfork distributions of random rooted and unrooted phylogenetic trees (Q1984673) (← links)
- The arithmetic topology of genetic alignments (Q2684033) (← links)
- A SURVEY ON ALGORITHMIC ASPECTS OF TANDEM REPEATS EVOLUTION (Q3021996) (← links)
- Neighborhoods of Phylogenetic Trees: Exact and Asymptotic Counts (Q5298170) (← links)
- A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem (Q6106606) (← links)
