497 search results - page 12 / 100 » DNA Computing Based on Splicing: Universality Results |
ISMB
1996
13 years 9 months ago
1996
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
MPC
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
IDA
2008
Springer
13 years 7 months ago
2008
Springer
We developed Relational Data Mining approach which allows to overcome essential limitations of the Data Mining and Knowledge Discovery techniques. In the paper the approach was im...
ISMIS
2003
Springer
14 years 26 days ago
2003
Springer
Abstract. A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions. Two...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
DNA self-assembly is an emerging technology with potential as a future replacement of conventional lithographic fabrication. A key challenge is the specification of appropriate DN...