This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

DNA computing is an area of natural computing based on the idea that molecular biology
processes can be used to perform arithmetic and logic operations on information encoded …

The combinatorial properties of Fibonacci words and arrays are now a popularly studied
concept in formal language theory. One such property is the palindromic property of words …

A gapped repeat (respectively, palindrome) occurring in a word w is a factor uvu
(respectively, u^Rvu) of w. In such a repeat (palindrome) u is called the arm of the repeat …

Pseudo-repetitions are a natural generalisation of the classical notion of repetitions in
sequences: they are the repeated concatenation of a word and its encoding under a certain …

A word is said to be primitive if it cannot be represented as any power of another word. It is a
well-known conjecture that the set of all primitive words Q over a non-trivial alphabet is not …

A DNA string is a Watson-Crick (WK-) palindrome when the complement of its reverse is
equal to itself. The Watson-Crick map** θ is an involution that is also an antimorphism. In …

One of the particularities of information encoded as DNA strands is that a string u contains
basically the same information as its Watson–Crick complement, denoted here as θ (u) …

The notion of repetition of factors in words is central to considerations on sequences. One of
the recent generalizations regarding this concept was introduced by Czeizler et al.(2010) …

Pseudo-repetitions are a generalization of the fundamental notion of repetitions in
sequences, considered initially in the framework of DNA computing and bioinformatics. We …