Hairpin lengthening: language theoretic and algorithmic results-Reference-Cited by-同舟云学术

Hairpin lengthening: language theoretic and algorithmic results

Published:2013-01-03 Issue:4 Volume:25 Page:987-1009
ISSN:0955-792X
Container-title:Journal of Logic and Computation
language:en
Short-container-title:J Logic Computation

Author:

Manea Florin,Martín-Vide Carlos,Mitrana Victor

Publisher

Oxford University Press (OUP)

Subject

Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science

Link

http://academic.oup.com/logcom/article-pdf/25/4/987/5146575/exs076.pdf

Reference23 articles.

1. Superposition Based on Watson–Crick-Like Complementarity

2. Castellanos J. Mitrana V. Some remarks on hairpin and loop languages. In: Ito M. Paun G. Yu S. , editors. Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin. World Scientific; 2001. p. 47-59.

3. Cheptea D. Martin-Vide C. Mitrana V. A new operation on words suggested by DNA biochemistry: hairpin completion. In: Dumas J. -G. , editor. Proceedings of Transgressive Computing 2006: a Conference in Honor of Jean Della Dora. University of Granada, Spain; 2006. p. 216-228.

4. Cormen T. H. Leiserson C. E. Rivest R. R . Introduction to Algorithms. MIT Press; 1990.

5. Deaton R. Murphy R. Garzon M. Franceschetti D. R. Stevens S. E. Good encodings for DNA-based solutions to combinatorial problems. In: Landweber L. Baum E. , editors. DNA Based Computers II. The American Mathematical Society; 1998. p. 247-258. DIMACS Series, vol. 44.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hairpin completions and reductions: semilinearity properties;Natural Computing;2020-06-27

2. Further Properties of Self-assembly by Hairpin Formation;Unconventional Computation and Natural Computation;2019

3. Toehold DNA Languages are Regular (Extended Abstract);Algorithms and Computation;2015

4. Hairpin Lengthening and Shortening of Regular Languages;Lecture Notes in Computer Science;2012