Theoretical Computer Science

DOI10.1007/11560586MaRDI QIDQ5395076zbMATH OpenOpenAlexFDO

Authors Giuditta Franco

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11560586

zbMATH Keywords

DNA ComputingPolymeraseRestriction EnzymesSATXPCR

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 2087017
• scientific article; zbMATH DE number 1735643
• Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
• scientific article; zbMATH DE number 1738648
• scientific article; zbMATH DE number 1342109

Cited in

(11)

• Emergence of random selections in evolution of biological populations
• On the overlap assembly of strings and languages
• scientific article; zbMATH DE number 2127871 (Why is no real title available?)
• Decoding genomic information
• An Algorithm for SAT Without an Extraction Phase
• scientific article; zbMATH DE number 1735643 (Why is no real title available?)
• scientific article; zbMATH DE number 2087017 (Why is no real title available?)
• Further remarks on DNA overlap assembly
• Algorithmic applications of XPCR
• State complexity of overlap assembly
• Conjugate word blending: formal model and experimental implementation by XPCR

This page was built for publication: Theoretical Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5395076)