Computational efficiency of intermolecular gene assembly

zbMATH Open1149.92314MaRDI QIDQ3536083FDOQ3536083

Ion Petre, Remco Loos, Tseren-Onolt Ishdorj

Publication date: 17 November 2008

Recommendations

• Solving a PSPACE-complete problem by gene assembly
• Computational power of intramolecular gene assembly
• scientific article; zbMATH DE number 1568810
• Gene Assembly Algorithms for Ciliates
• scientific article; zbMATH DE number 2156287

zbMATH Keywords

non-determinismTuring machinesciliatesparallel time complexity

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Analysis of algorithms and problem complexity (68Q25) Cell biology (92C37)

Cited In (3)

• Optimal Omnitig Listing for Safe and Complete Contig Assembly
• Combinatorial Pattern Matching
• DNA Computing

This page was built for publication: Computational efficiency of intermolecular gene assembly

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