On Some Algorithmic Problems Regarding the Hairpin Completion

DOI10.1016/J.ENDM.2006.08.061MaRDI QIDQ3439535zbMATH OpenOpenAlexFDO

Authors Victor Mitrana, Florin Manea, Carlos Martín-Vide

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.08.061

zbMATH Keywords

context-free languagehairpin completioniterated hairpin completionregular language

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20)

Recommendations

• On some algorithmic problems regarding the hairpin completion
• A series of algorithmic results related to the iterated hairpin completion
• Some remarks on the hairpin completion
• On the Hairpin Completion of Regular Languages
• Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)

Cited in

(5)

• Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
• On some algorithmic problems regarding the hairpin completion
• Some remarks on the hairpin completion
• Bounded Hairpin Completion
• A series of algorithmic results related to the iterated hairpin completion

This page was built for publication: On Some Algorithmic Problems Regarding the Hairpin Completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439535)