Further remarks on DNA overlap assembly
From MaRDI portal
Publication:515580
DOI10.1016/j.ic.2017.01.009zbMath1359.68069OpenAlexW2573386179MaRDI QIDQ515580
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
Related Items (4)
Outfix-guided insertion ⋮ Conjugate word blending: formal model and experimental implementation by XPCR ⋮ Outfix-Guided Insertion ⋮ State Complexity of Overlap Assembly
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the containment and equivalence problems for two-way transducers
- On iterated hairpin completion
- Algorithmic applications of XPCR
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Self-assembly of strings and languages
- On some algorithmic problems regarding the hairpin completion
- The method of forced enumeration for nondeterministic automata
- Reversal-bounded multipushdown machines
- 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
- Nondeterministic Space is Closed under Complementation
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Theoretical Computer Science
- Multiplying matrices faster than coppersmith-winograd
- Hairpin Completion Versus Hairpin Reduction
- DNA Computing
- Automata with Reversal-Bounded Counters: A Survey
- A note on computing time for recognition of languages generated by linear grammars
- One-way stack automata
This page was built for publication: Further remarks on DNA overlap assembly
