Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results
From MaRDI portal
Publication:2490509
DOI10.1016/j.compbiolchem.2005.09.007zbMath1087.92030WikidataQ42673815 ScholiaQ42673815MaRDI QIDQ2490509
Y. I. Ronin, Abraham B. Korol, D. I. Mester, M. A. Korostishevsky, V. L. Pikus, A. E. Glazman
Publication date: 16 May 2006
Published in: Computational Biology and Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.compbiolchem.2005.09.007
TSP; Multilocus ordering; Re-sampling verification; Synchronized discrete optimization; Unstable neighborhoods
90C35: Programming involving graphs or networks
90C90: Applications of mathematical programming
92C40: Biochemistry, molecular biology
92-08: Computational methods for problems pertaining to biology
Related Items
Uses Software
Cites Work
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- On the solution of traveling salesman problems
- Bootstrap methods: another look at the jackknife
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results
- Fast and high precision algorithms for optimization in large-scale genomic problems
- Solution of a Min-Max Vehicle Routing Problem
- Solution of a Large-Scale Traveling-Salesman Problem
