Sciweavers

621 search results - page 20 / 125
» DNA Computing in Microreactors
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
CSB
2003
IEEE
14 years 1 months ago
Fast and Accurate Probe Selection Algorithm for Large Genomes
The oligo microarray (DNA chip) technology in recent years has a significant impact on genomic study. Many fields such as gene discovery, drug discovery, toxicological research ...
Wing-Kin Sung, Wah-Heng Lee
RECOMB
2005
Springer
14 years 8 months ago
Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis
Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nathan...
RECOMB
2003
Springer
14 years 8 months ago
Engineering a scalable placement heuristic for DNA probe arrays
Andrew B. Kahng, Ion I. Mandoiu, Pavel A. Pevzner,...
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 1 months ago
Evolutionary computation and the c-value paradox
The C-value Paradox is the name given in biology to the wide variance in and often very large amount of DNA in eukaryotic genomes and the poor correlation between DNA length and p...
Sean Luke