Pages that link to "Item:Q1850993"
From MaRDI portal
The following pages link to Heuristics for the phylogeny problem (Q1850993):
Displaying 10 items.
- 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)
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem (Q932185) (← links)
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem (Q953320) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion (Q1715640) (← links)
- Scatter search with path relinking for phylogenetic inference (Q2570151) (← links)
- Walking tree heuristics for biological string alignment, gene location, and phylogenies (Q3022148) (← links)
- A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure (Q3025048) (← links)
