Sciweavers

185 search results - page 4 / 37

» dna 2005

108

CPM
2005
Springer

194views Combinatorics» more CPM 2005»

DNA Compression Challenge Revisited: A Dynamic Programming Approach

15 years 11 months ago

DNA Compression Challenge Revisited: A Dynamic Programming Approach

Download www.cs.ucr.edu

Behshad Behzadi, Fabrice Le Fessant

claim paper

Read More »

107

BIOINFORMATICS
2005

43views more BIOINFORMATICS 2005»

A parallel graph decomposition algorithm for DNA sequencing with nanopores

15 years 5 months ago

A parallel graph decomposition algorithm for DNA sequencing with nanopores

Download bmi.osu.edu

Shahid H. Bokhari, Jon R. Sauer

claim paper

Read More »

87

BIOINFORMATICS
2005

63views more BIOINFORMATICS 2005»

DNA assembly with gaps (Dawg): simulating sequence evolution

15 years 5 months ago

DNA assembly with gaps (Dawg): simulating sequence evolution

Download dererumnatura.us

Reed A. Cartwright

claim paper

Read More »

121

BIOINFORMATICS
2005

63views more BIOINFORMATICS 2005»

LS Bound based gene selection for DNA microarray data

15 years 5 months ago

LS Bound based gene selection for DNA microarray data

Download cbio.ensmp.fr

Xin Zhou, K. Z. Mao

claim paper

Read More »

140

ICALP
2005
Springer

72views Programming Languages» more ICALP 2005»

Randomized Fast Design of Short DNA Words

15 years 11 months ago

Randomized Fast Design of Short DNA Words

Download www.cs.panam.edu

We consider the problem of eﬃciently 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

claim paper

Read More »

« Prev « First page 4 / 37 Last » Next »