Scheduled System Maintenance:
On April 27th, single article purchases and IEEE account management will be unavailable from 2:00 PM - 4:00 PM ET (18:00 - 20:00 UTC).
We apologize for the inconvenience.
By Topic

Usefulness of solution algorithms of the traveling salesman problem in the typing of biological sequences in a clinical laboratory setting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)
Eisele, J.G. ; Depto. de Quimica y Biologia, Univ. de las Americas, Puebla, Mexico ; Roldan, C.Y.C. ; Galindo, M.O. ; Gil, Md.P.G.

Our concern is to solve the problem of the typing of deoxyribonucleic acid (DNA) sequences in a laboratory setting. Here we try to find solution algorithms for the classification of restriction patterns which form part of this problem, in order to evaluate the amount of information generated by a given restriction enzyme. A distance matrix is generated by comparison of each restriction pattern and used to classify the patterns according to their similarity. This problem can be mapped to the traveling salesman problem (TSP). Several known and new solution algorithms have been tested. Interestingly, a very simple and modified nearest neighbor analysis performed best for this kind of problem. However, when the distance matrix is replaced by a "distinction matrix" (expresses directly, with the help of a threshold function, the similarity, 0, or dissimilarity, 1, between restriction patterns), the results of at least one local search algorithm are dramatically improved.

Published in:

Electronics, Communications and Computers, 2004. CONIELECOMP 2004. 14th International Conference on

Date of Conference:

16-18 Feb. 2004