Sciweavers

497 search results - page 6 / 100
» DNA Computing Based on Splicing: Universality Results
Sort
View
DNA
2004
Springer
165views Bioinformatics» more  DNA 2004»
14 years 1 months ago
Computing by Observing Bio-systems: The Case of Sticker Systems
Abstract. A very common approach in chemistry and biology is to observe the progress of an experiment, and take the result of this observation as the final output. Inspired by thi...
Artiom Alhazov, Matteo Cavaliere
IPPS
2000
IEEE
14 years 1 days ago
A Surface-Based DNA Algorithm for the Expansion of Symbolic Determinants
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
Zhiquan Frank Qiu, Mi Lu
BIRTHDAY
2004
Springer
14 years 1 months ago
Two Models for Gene Assembly in Ciliates
Two models for gene assembly in ciliates have been proposed and investigated in the last few years. The DNA manipulations postulated in the two models are very different: one mode...
Tero Harju, Ion Petre, Grzegorz Rozenberg
BMCBI
2007
158views more  BMCBI 2007»
13 years 7 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 1 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao