Genetic algorithms and tabu search for correcting lanes in DNA images

Authors:
M. J. Angélica Pinninghoff;Q. Daniel Venegas;A. Ricardo Contreras
Affiliations:
Department of Computer Science, University of Concepción, Chile;Department of Computer Science, University of Concepción, Chile;Department of Computer Science, University of Concepción, Chile
Venue:
MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
Year:
2010

Citing 4
Cited 1

Tabu Search

Tabu Search
Bio-Inspired Artificial Intelligence: Theories, Methods, and Technologies

Bio-Inspired Artificial Intelligence: Theories, Methods, and Technologies
An Evolutionary Approach for Correcting Random Amplified Polymorphism DNA Images

IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part II: Bioinspired Applications in Artificial and Natural Computation
Processing random amplified polymorphysm DNA images using the radon transform and mathematical morphology

ICIAR'07 Proceedings of the 4th international conference on Image Analysis and Recognition

Band correction in random amplified polymorphism DNA images using hybrid genetic algorithms with multilevel thresholding

IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation: new challenges on bioinspired applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an experience that combines Genetic Algorithms and Tabu Search as a mechanism for correcting lanes in DNA images obtained through Random Amplified Polymorphism DNA (RAPD) technique. RAPDs images are affected by various factors; among these factors, the noise and distortion that impact the quality of images, and subsequently, accuracy in interpreting the data. This work proposes a hybrid method that uses genetic algorithms, for dealing with the highly combinatorial feature of this problem, and tabu search, for dealing with local optimum. The results obtained by using them in this particular problem show an improvement in both, fitness of individuals and execution time.