86 search results - page 9 / 18 » DNA Models and Algorithms for NP-Complete Problems |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We introduce the problem of shape replication in the Wang tile self-assembly model. Given an input shape, we consider the problem of designing a self-assembly system which will re...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. Different approaches to infer the dependencies of gene r...
STOC
1995
ACM
13 years 11 months ago
1995
ACM
Genomes frequently evolve by reversals (i, j) that transform a gene order 1 . . . iiϩ1 . . . jϪ1j . . . n into 1 . . . ijϪ1 . . . iϩ1j . . ....
WABI
2007
Springer
14 years 1 months ago
2007
Springer
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
SAC
2003
ACM
14 years 28 days ago
2003
ACM
DNA microarray hybridisation is a popular high throughput technique in academic as well as industrial functional genomics research. In this paper we present a new approach to auto...