Fast and high precision algorithms for optimization in large-scale genomic problems
- 25 September 2004
- journal article
- research article
- Published by Elsevier in Computational Biology and Chemistry
- Vol. 28 (4) , 281-290
- https://doi.org/10.1016/j.compbiolchem.2004.08.003
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Physical mapping with automatic capture of hybridization dataBioinformatics, 2001
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- Neighbour mapping as a method for ordering genetic markersGenetics Research, 1997
- Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSPINFORMS Journal on Computing, 1996
- Mapping dominant markers using F2 matingsTheoretical and Applied Genetics, 1995
- Preliminary ordering of multiple linked loci using pairwise linkage dataGenetic Epidemiology, 1992
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986
- Optimization by Simulated AnnealingScience, 1983
- Bootstrap Methods: Another Look at the JackknifeThe Annals of Statistics, 1979
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973