Computing maximal Kleene closures that are embeddable in a given constrained DNA language. (English)
Cardelli, Luca (ed.) et al., DNA computing and molecular programming. 17th international conference, DNA 17, Pasadena, CA, USA, September 19‒23, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23637-2/pbk). Lecture Notes in Computer Science 6937, 115-129 (2011).
1
A relation by palindromic subwords. (English)
Nat. Comput. 9, No. 4, 935-954 (2010).
2
Watson-Crick palindromes in DNA computing. (English)
Nat. Comput. 9, No. 2, 297-316 (2010).
3
Involutively bordered words. (English)
Int. J. Found. Comput. Sci. 18, No. 5, 1089-1106 (2007).
4
Sticky-free and overhang-free DNA languages. (English)
Acta Inf. 40, No. 2, 119-157 (2003).
5
Start
Contact
Print
General Help
