Ordering of high-density markers by the k-optimal algorithm for the traveling-salesman problem
Construction of accurate and high-density linkage maps is a key research area of genetics. We investigated the efficiency of genetic map construction (MAP) using modifications of the k-Optimal (k-Opt) algorithm for solving the traveling-salesman problem (TSP). For TSP, different initial routes resul...
| Main Authors: | , , , |
|---|---|
| Format: | Journal Article |
| Language: | Inglés |
| Published: |
Elsevier
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10568/171258 |
Similar Items: Ordering of high-density markers by the k-optimal algorithm for the traveling-salesman problem
- GA-GBLUP: leveraging the genetic algorithm to improve the predictability of genomic selection
- Genetic algorithms for the sequential irrigation scheduling problem
- Simultaneous-irrigation scheduling GA [genetic algorithm] model with identical discharges and travel time
- Development of a core set from a large rice collection using a modified heuristic algorithm to retain maximum diversity
- QTL IciMapping: Integrated software for genetic linkage map construction and quantitative trait locus mapping in biparental populations
- Algorithmic differentiation of linear mixed models with variance-covariance structures