Ordering of high-density markers by the k-Optimal algorithm for the traveling-salesman problem

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...

Full description

Bibliographic Details
Main Authors: Luyan Zhang, Huihui Li, Lei Meng, Jiankang Wang
Format: Article
Language:English
Published: KeAi Communications Co., Ltd. 2020-10-01
Series:Crop Journal
Subjects:
k-Optimal algorithm
Linkage analysis
Genetic map construction
Traveling salesman problem
Recombination frequency
Online Access:http://www.sciencedirect.com/science/article/pii/S2214514120300519

Internet

http://www.sciencedirect.com/science/article/pii/S2214514120300519

Similar Items