Sciweavers

185 search results - page 4 / 37
» dna 2005
Sort
View
CPM
2005
Springer
194views Combinatorics» more  CPM 2005»
15 years 5 months ago
DNA Compression Challenge Revisited: A Dynamic Programming Approach
Behshad Behzadi, Fabrice Le Fessant
59
Voted
BIOINFORMATICS
2005
43views more  BIOINFORMATICS 2005»
15 years 2 days ago
A parallel graph decomposition algorithm for DNA sequencing with nanopores
Shahid H. Bokhari, Jon R. Sauer
51
Voted
BIOINFORMATICS
2005
63views more  BIOINFORMATICS 2005»
15 years 2 days ago
DNA assembly with gaps (Dawg): simulating sequence evolution
Reed A. Cartwright
72
Voted
BIOINFORMATICS
2005
63views more  BIOINFORMATICS 2005»
15 years 1 days ago
LS Bound based gene selection for DNA microarray data
Xin Zhou, K. Z. Mao
ICALP
2005
Springer
15 years 5 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