5 search results - page 1 / 1 » A Surface-Based DNA Algorithm for the Expansion of Symbolic ... |
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
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...
GCB
2000
Springer
13 years 8 months ago
2000
Springer
In previous work [10], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this w...
CCECE
2006
IEEE
13 years 11 months ago
2006
IEEE
During recent years there has been an explosive growth of biological data coming from genome projects, proteomics, protein structure determination, and the rapid expansion in digi...
RECOMB
2003
Springer
14 years 5 months ago
2003
Springer
In [13] we reported the genome sequences of S. paradoxus, S. mikatae and S. bayanus and compared these three yeast species to their close relative, S. cerevisiae. Genome-wide comp...
IANDC
2008
13 years 5 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...