Clustering over DNA strings

Authors:
Nuria Gomez Blas;Eugenio Santos;Miguel Angel Diaz
Affiliations:
Escuela de Informática, Dept. OEI, UPM, Madrid, Spain;Escuela de Informática, Dept. OEI, UPM, Madrid, Spain;Escuela de Informática, Dept. OEI, UPM, Madrid, Spain
Venue:
CIMMACS'06 Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics
Year:
2006

Citing 6
Cited 0

Molecular computation of solutions to combinatorial problems

Science
On the computational power of DNA

Discrete Applied Mathematics - Special volume on computational molecular biology
Using DNA to solve the bounded Post correspondence problem

Theoretical Computer Science - Special issue on universal machines and computations
Theoretical and Experimental DNA Computation (Natural Computing Series)

Theoretical and Experimental DNA Computation (Natural Computing Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: A Review

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an unsupervised learning algorithm over strings that can be applied in aminoacid sequences. This way a set of aminoacids is obtained and they represent the minimal distance to the whole DNA pool. Biological laboratory protocols over this cluster could be easily studied instead over the whole pool and protocols could be used in the whole pool. This process can help to develop protocols applicable in the DNA computing paradigm. A brief review of DNA computing is also shown.