Further remarks on DNA overlap assembly

DOI10.1016/J.IC.2017.01.009MaRDI QIDQ515580zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• On the overlap assembly of strings and languages
• State complexity of overlap assembly
• State complexity of overlap assembly
• Self-assembly of strings and languages
• On some operations on strings suggested by gene assembly in ciliates

Cites work

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

Cited in

(7)

• Outfix-guided insertion (extended abstract)
• Conjugate word blending: formal model and experimental implementation by XPCR
• State complexity of overlap assembly
• State complexity of overlap assembly
• Outfix-guided insertion
• scientific article; zbMATH DE number 3961392 (Why is no real title available?)
• On the overlap assembly of strings and languages

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)