5404 search results - page 319 / 1081 » Global Computing for Bioinformatics |
138
click to vote
DNA
2004
Springer
15 years 11 months ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
160
Voted
DNA
2004
Springer
15 years 11 months ago
2004
Springer
A very basic problem in all DNA computations is finding a good encoding. Apart from the fact that they must provide a solution, the strands involved should not exhibit any undesir...
177
Voted
CSB
2003
IEEE
15 years 11 months ago
2003
IEEE
Physical map reconstruction in the presence of errors is a central problem in genetics of high computational complexity. A parallel genetic algorithm for a maximum likelihood esti...
127
click to vote
DNA
2003
Springer
15 years 11 months ago
2003
Springer
Affinity separation with magnetic beads is an important and widely used technique for DNA computing. We have designed and implemented an experimental lab-on-a-chip module for affin...
169
click to vote
ICANN
2007
Springer
15 years 10 months ago
2007
Springer
In todays bioinformatics, Mass spectrometry (MS) is the key technique for the identification of proteins. A prediction of spectrum peak intensities from pre computed molecular feat...