Solving a PSPACE-complete problem by gene assembly

DOI10.1093/LOGCOM/EXR052zbMATH Open1271.68106OpenAlexW2018920295MaRDI QIDQ2844005FDOQ2844005

Monika Sturm, Thomas Zerjatke

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)

Cited In (2)

• Combinatorial Pattern Matching
• 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)