Theoretical Computer Science

DOI10.1007/11560586zbMath1171.68478OpenAlexW2603408665MaRDI QIDQ5395076

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

SATDNA ComputingXPCRPolymeraseRestriction Enzymes

Mathematics Subject Classification ID

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

Related Items (7)

Conjugate word blending: formal model and experimental implementation by XPCR ⋮ Decoding Genomic Information ⋮ Further remarks on DNA overlap assembly ⋮ Emergence of random selections in evolution of biological populations ⋮ Algorithmic applications of XPCR ⋮ On the overlap assembly of strings and languages ⋮ State Complexity of Overlap Assembly

This page was built for publication: Theoretical Computer Science