Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
DOI10.1016/J.TCS.2008.09.049zbMATH Open1160.68022OpenAlexW2058038744MaRDI QIDQ1004085FDOQ1004085
Authors: Florin Manea, Victor Mitrana, Takashi Yokomori 
Publication date: 2 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.049
Recommendations
Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Title not available (Why is that?)
- Recognition and parsing of context-free languages in time n3
- A geometric hierarchy beyond context-free languages
- Tree adjunct grammars
- Indexed Grammars—An Extension of Context-Free Grammars
- Simple matrix languages
- Title not available (Why is that?)
- Hairpin Completion Versus Hairpin Reduction
- Hairpin languages
- Superposition based on Watson-Crick-like complementarity
- Title not available (Why is that?)
- Developments in Language Theory
- On Some Algorithmic Problems Regarding the Hairpin Completion
- SOME REMARKS ON HAIRPIN AND LOOP LANGUAGES
- Title not available (Why is that?)
Cited In (22)
- STRING OPERATIONS SUGGESTED BY DNA BIOCHEMISTRY: THE BALANCED CUT OPERATION
- Hairpin Finite Automata
- Title not available (Why is that?)
- Language theoretical properties of hairpin formations
- Hairpin Completion Versus Hairpin Reduction
- On iterated hairpin completion
- On decidability and closure properties of language classes with respect to bio-operations
- A series of algorithmic results related to the iterated hairpin completion
- Deciding regularity of hairpin completions of regular languages in polynomial time
- Some remarks on the hairpin completion
- On the hairpin incompletion
- It is NL-complete to decide whether a hairpin completion of regular languages is regular
- Two-sided derivatives for regular expressions and for hairpin expressions
- Hairpin completions and reductions: semilinearity properties
- Testing DNA code words properties of regular languages
- The pseudopalindromic completion of regular languages
- Bounded hairpin completion
- Hairpin Lengthening and Shortening of Regular Languages
- Bounded Hairpin Completion
- Iterated hairpin completions of non-crossing words
- Regularity of iterative hairpin completions of crossing \((2, 2)\)-words
- Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
This page was built for publication: Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004085)
