Further remarks on DNA overlap assembly

DOI10.1016/J.IC.2017.01.009zbMATH Open1359.68069OpenAlexW2573386179MaRDI QIDQ515580FDOQ515580

Lila Kari, Steffen Kopecki, Oscar H. Ibarra, Srujan Kumar Enaganti

Publication date: 16 March 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2017.01.009

zbMATH Keywords

DNA computingDNA self-assemblybio-operationsoverlap assembly

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reversal-bounded multipushdown machines
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Multiplying matrices faster than coppersmith-winograd
• Automata with Reversal-Bounded Counters: A Survey
• Nondeterministic Space is Closed under Complementation
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The method of forced enumeration for nondeterministic automata
• On some algorithmic problems regarding the hairpin completion
• On the containment and equivalence problems for two-way transducers
• Hairpin Completion Versus Hairpin Reduction
• On iterated hairpin completion
• Self-assembly of strings and languages
• The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors
• Existence of constants in regular splicing languages
• Superposition based on Watson-Crick-like complementarity
• Computing by polymerase chain reaction
• A tissue \(P\) system and a DNA microfluidic device for solving the shortest common superstring problem
• A formal language model of DNA polymerase enzymatic activity
• DNA Recombination by XPCR
• Some Remarks on Superposition Based on Watson-Crick-Like Complementarity
• Theoretical Computer Science
• DNA Computing
• Algorithmic applications of XPCR
• A note on computing time for recognition of languages generated by linear grammars
• One-way stack automata

Cited In (4)

• State Complexity of Overlap Assembly
• Outfix-Guided Insertion
• Conjugate word blending: formal model and experimental implementation by XPCR
• Outfix-guided insertion

This page was built for publication: Further remarks on DNA overlap assembly

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