Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

82

Voted

JCSS
1998

39views more JCSS 1998»

DNA Models and Algorithms for NP-Complete Problems

15 years 2 months ago

DNA Models and Algorithms for NP-Complete Problems

Download www.cs.ubc.ca

Eric Bach, Anne Condon, Elton Glaser, Celena Tangu

Real-time Traffic

JCSS 1998 |

claim paper

Related Content

» Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Paramete...

» 3D Shape Matching Using Skeleton Graphs

» Consistency of SequenceBased Gene Clusters

» Design Simulation and Experimental Demonstration of Selfassembled DNA Nanostructures and M...

» Addressing Mode Selection

» Algorithms for optimizing production DNA sequencing

» Broadcasting on large scale heterogeneous platforms under the bounded multiport model

» DNA Computation Theory Practice and Prospects

» Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	JCSS
Authors	Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay

Comments (0)