Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Formal languages
String-rewriting systems
Contextual insertions/deletions and computability
Information and Computation
Handbook of Formal Languages
Deleting string rewriting systems preserve regularity
Theoretical Computer Science - Developments in language theory
Superposition Based on Watson–Crick-Like Complementarity
Theory of Computing Systems
Hairpin Completion Versus Hairpin Reduction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
Theoretical Computer Science
On some algorithmic problems regarding the hairpin completion
Discrete Applied Mathematics
Combinatorial queries and updates on partial words
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
On hairpin-free words and languages
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
On iterated hairpin completion
Theoretical Computer Science
Deciding regularity of hairpin completions of regular languages in polynomial time
Information and Computation
On the Regularity of Iterated Hairpin Completion of a Single Word
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Hairpin completion with bounded stem-loop
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Hi-index | 0.00 |
Hairpin completion is a formal operation inspired from biochemistry. Here we consider a restricted variant of hairpin completion called bounded hairpin completion. Applied to a word encoding a single stranded molecule x such that either a suffix or a prefix of x is complementary to a subword of x, hairpin completion produces a new word z, which is a prolongation of x to the right or to the left by annealing. Although this operation is a purely mathematical one and the biological reality is just a source of inspiration, it seems rather unrealistic to impose no restriction on the length of the prefix or suffix added by the hairpin completion. The restriction considered here concerns the length of all prefixes and suffixes that are added to the current word by hairpin completion. They cannot be longer than a given constant. Closure properties of some classes of formal languages under the non-iterated and iterated bounded hairpin completion are investigated. We consider the bounded hairpin completion distance between two words and generalize this distance to languages and discuss algorithms for computing them. Finally also the inverse operation, namely bounded hairpin reduction, as well as the set of all primitive bounded hairpin roots of a regular language are considered.