Computer a DNA: differenze tra le versioni

Contenuto cancellato Contenuto aggiunto
FixBot (discussione | contributi)
m Bot: sostituisco l'entitità '–' con '–'
FixBot (discussione | contributi)
m Bot: sostituisco l'entitità '—' con '—'
Riga 22:
| pages = 1021–1024
| url = http://www.usc.edu/dept/molecular-science/papers/fp-sci94.pdf
}} <!-- &mdash; The first DNA computing paper. Describes a solution for the directed [[Hamiltonian path problem]]. -->
*{{cite book
| author = [[Martyn Amos]]
Riga 31:
| id = ISBN 3-540-65773-8
| url = http://www.springeronline.com/sgw/cda/frontpage/0,11855,3-0-22-1995351-0,00.html
}} <!-- &mdash; The first general text to cover the whole field. -->
*{{cite journal
| author = [[Dan Boneh]], Christopher Dunworth, [[Richard J. Lipton]], and Jiri Sgall
Riga 39:
| volume = 71
| url = http://citeseer.ist.psu.edu/boneh95computational.html
}} <!-- &mdash; Describes a solution for the [[boolean satisfiability problem]]. -->
*{{cite book
| author = Gheorge Paun, Grzegorz Rozenberg, [[Arto Salomaa]]
Riga 47:
| publisher = Springer-Verlag
| id = ISBN 3-540-64196-3
}} <!-- &mdash; The book starts with an introduction to DNA-related matters, the basics of biochemistry and language and computation theory, and progresses to the advanced mathematical theory of DNA computing. -->
*{{cite journal
| author = Lila Kari, Greg Gloor, Sheng Yu
Riga 58:
| pages = 192–203
| url = http://citeseer.ist.psu.edu/kari00using.html
}} <!-- &mdash; Describes a solution for the bounded [[Post correspondence problem]], a hard-on-average NP-complete problem. -->
*{{cite book
| author = JB. Waldner