A series of algorithmic results related to the iterated hairpin completion

DOI10.1016/J.TCS.2010.06.014zbMath1208.68138OpenAlexW1987516575MaRDI QIDQ606982

Florin Manea

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

zbMATH Keywords

DNA computinghairpin completionhairpin completion distanceiterated hairpin completionsegment tree

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Iterated Hairpin Completions of Non-crossing Words ⋮ Hairpin Lengthening and Shortening of Regular Languages ⋮ Hairpin completions and reductions: semilinearity properties ⋮ Language theoretical properties of hairpin formations

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

This page was built for publication: A series of algorithmic results related to the iterated hairpin completion