Solving a PSPACE-complete problem by gene assembly

DOI10.1093/LOGCOM/EXR052MaRDI QIDQ2844005zbMATHzbMATHOpenAlexFDO

Authors Thomas Zerjatke, Monika Sturm

Publication date 27 August 2013

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exr052

zbMATH Keywords

DNA computingPSPACE-completenessquantified Boolean formulasgene assembly

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Solutions to Computational Problems Through Gene Assembly
• Solutions to computational problems through gene assembly
• scientific article; zbMATH DE number 2156287
• Computing Through Gene Assembly
• Computational power of intramolecular gene assembly

Cited in

(6)

• Computing Through Gene Assembly
• Solutions to computational problems through gene assembly
• Combinatorial Pattern Matching
• Computational efficiency of intermolecular gene assembly
• Solutions to Computational Problems Through Gene Assembly
• Solving the gene duplication feasibility problem in linear time

This page was built for publication: Solving a PSPACE-complete problem by gene assembly

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