Sciweavers

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

34

MCU
1998

favoriteEmaildiscussreport

93views Hardware» more MCU 1998»

Using DNA to solve the Bounded Post Correspondence Problem

14 years 5 days ago

Using DNA to solve the Bounded Post Correspondence Problem

Download www.cs.tau.ac.il

Lila Kari, Greg Gloor, Sheng Yu

Real-time Traffic

MCU 1998 | MCU 2007 |

claim paper

Related Content

» Binary generalized Post Correspondence Problem

» FPGA based architecture for DNA sequence comparison and database search

» Posted prices vs negotiations an asymptotic analysis

» Extending Dantzigs bound to the bounded multipleclass binary Knapsack problem

» Negative thinking by incremental problem solving application to unate covering

» Arcsstates models for the vehicle routing problem with time windows and related problems

» Discovering Frequent PolyRegions in DNA Sequences

» Analysis of nonoverlapping domain decomposition algorithms with inexact solves

» Discriminacy of the minimum range approach to blind separation of bounded sources

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1998
Where	MCU
Authors	Lila Kari, Greg Gloor, Sheng Yu

Comments (0)