default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 19 matches
- 2001
- Anne Condon, Grzegorz Rozenberg:
DNA Computing, 6th International Workshop on DNA-Based Computers, DNA 2000, Leiden, The Netherlands, June 13-17, 2000, Revised Papers. Lecture Notes in Computer Science 2054, Springer 2001, ISBN 3-540-42076-2 [contents] - 2000
- Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza:
DNA and Circular Splicing. DNA Computing 2000: 117-129 - Ravinderjit S. Braich, Cliff Johnson, Paul W. K. Rothemund, Darryl Hwang, Nickolas V. Chelyapov, Leonard M. Adleman:
Solution of a Satisfiability Problem on a Gel-Based DNA Computer. DNA Computing 2000: 27-42 - Kevin Chen, Vijay Ramachandran:
A Space-Efficient Randomized DNA Algorithm for k-SAT. DNA Computing 2000: 199-208 - Sergio Díaz, Juan Luis Esteban, Mitsunori Ogihara:
A DNA-Based Random Walk Method for Solving k-SAT. DNA Computing 2000: 209-219 - Rudolf Freund, Franziska Freund:
Molecular Computing with Generalized Homogeneous P-Systems. DNA Computing 2000: 130-144 - Pierluigi Frisco:
Diophantine Equations and Splicing: A New Demonstration of the Generative Capability of H Systems. DNA Computing 2000: 43-52 - Elizabeth Goode, David Harlan Wood, Junghuei Chen:
DNA Implementation of a Royal Road Fitness Evaluation. DNA Computing 2000: 247-262 - Masami Hagiya:
From Molecular Computing to Molecular Programming. DNA Computing 2000: 89-102 - Ken Komiya, Kensaku Sakamoto, Hidetaka Gouzu, Shigeyuki Yokoyama, Masanori Arita, Akio Nishikawa, Masami Hagiya:
Successive State Transitions with I/O Interface by Molecules. DNA Computing 2000: 17-26 - Maurice Margenstern, Yurii Rogozhin:
About Time-Varying Distributed H Systems. DNA Computing 2000: 53-62 - John S. McCaskill, Ulrich Niemann:
Graph Replacement Chemistry for DNA Processing. DNA Computing 2000: 103-116 - John S. McCaskill, Robert Penchovsky, Marlies Gohlke, Jörg Ackermann, Thomas Rücker:
Steady Flow Micro-Reactor Module for Pipelined DNA Computations. DNA Computing 2000: 263-270 - John H. Reif, Thomas H. LaBean:
Computationally Inspired Biotechnologies: Improved DNA Synthesis and Associative Search Using Error-Correcting Codes and Vector-Quantization. DNA Computing 2000: 145-172 - John H. Reif, Thomas H. LaBean, Nadrian C. Seeman:
Challenges and Applications for Self-Assembled DNA Nanostructures. DNA Computing 2000: 173-198 - John A. Rose, Russell J. Deaton:
The Fidelity of Annealing-Ligation: A Theoretical Analysis. DNA Computing 2000: 231-246 - Yasubumi Sakakibara:
Solving Computational Learning Problems of Boolean Formulae on DNA Computers. DNA Computing 2000: 220-230 - Ron Weiss, Thomas F. Knight Jr.:
Engineered Communications for Microbial Robotics. DNA Computing 2000: 1-16 - Erik Winfree, Tony Eng, Grzegorz Rozenberg:
String Tile Models for DNA Computing by Self-Assembly. DNA Computing 2000: 63-88
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-25 09:05 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint