Solution of a problem in DNA Computing

Authors:
Eric Anderson;Marek Chrobak;John Noga;Jirí Sgall;Gerhard J. Woeginger
Affiliations:
Department of Computer Science, University of Washington, Seattle, WA;Department of Computer Science, University of California, Riverside, CA;TU Graz, Institut für Mathematik B, Steyrergasse 30, A-8010 Graz, Austria;Mathematical Institute, AS CR, Zitná 25, CZ-11567 Praha 1, Czech Republic;TU Graz, Institut für Mathematik B, Steyrergasse 30, A-8010 Graz, Austria
Venue:
Theoretical Computer Science
Year:
2002

Citing 3
Cited 1

Universal and simple operations for gene assembly in ciliates

Where mathematics, computer science, linguistics and biology meet
Reversible Molecular Computation in Ciliates

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

Combinatorial models of gene assembly

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms

Quantified Score

Hi-index	5.23

Visualization

Abstract

We answer a question of Rozenberg and Salomaa arising from a problem in DNA computing. This problem was posed at the ICALP conference in July 1999 in Prague.