Superposition Based on Watson–Crick-Like Complementarity

@article{Bottoni2004SuperpositionBO,
  title={Superposition Based on Watson–Crick-Like Complementarity},
  author={Paolo Bottoni and Anna Labella and Vincenzo Manca and Victor Mitrana},
  journal={Theory of Computing Systems},
  year={2004},
  volume={39},
  pages={503-524}
}
In this paper we propose a new formal operation on words and languages, called superposition. By this operation, based on a Watson–Crick-like complementarity, we can generate a set of words, starting from a pair of words, in which the contribution of a word to the result need not be one subword only, as happens in classical bio-operations of DNA computing. Specifically, starting from two single stranded molecules x and y such that a suffix of x is complementary to a prefix of y, a prefix of x… CONTINUE READING
15 Citations
18 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 18 references

A DNA algorithm for 3-SAT(11,20)

  • V. Manca, S. Di Gregorio, D. Lizzari, G. Vallini, C. Zandron
  • Proc. 7th Intern. Meeting on DNA Based Computers…
  • 2001
2 Excerpts

Hairpin languages

  • G. Rozenberg Gh. Păun, T. Yokomori
  • Intern . J . Found . Comp . Sci .
  • 2001

Genome encoding for DNA computing

  • M. Garzon, R. Deaton, L. F. Nino, S. E. Stevens, M. Wittner
  • Proc. Third Genetic Programming Conference,
  • 1998
1 Excerpt

Grammars working on layered strings

  • V. Mitrana J. Castellanos
  • Acta Cybernetica
  • 1998

Sticker systems , Theoret

  • G. Rozenberg Gh. Păun
  • 1998

Similar Papers

Loading similar papers…