A series of algorithmic results related to the iterated hairpin completion
From MaRDI portal
Publication:606982
DOI10.1016/j.tcs.2010.06.014zbMath1208.68138MaRDI QIDQ606982
Publication date: 19 November 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.06.014
DNA computing; hairpin completion; hairpin completion distance; iterated hairpin completion; segment tree
68Q45: Formal languages and automata
Related Items
Hairpin completions and reductions: semilinearity properties, Language theoretical properties of hairpin formations, Iterated Hairpin Completions of Non-crossing Words, Hairpin Lengthening and Shortening of Regular Languages
Cites Work
- Unnamed Item
- Unnamed Item
- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
- On some algorithmic problems regarding the hairpin completion
- Decomposable searching problems
- Superposition based on Watson-Crick-like complementarity
- Algorithms for Reporting and Counting Geometric Intersections
- On the Hairpin Completion of Regular Languages
- Fast Pattern Matching in Strings
- SOME REMARKS ON HAIRPIN AND LOOP LANGUAGES
- HAIRPIN LANGUAGES
- Hairpin Completion Versus Hairpin Reduction
- Developments in Language Theory