33 research outputs found
An extension of the Lyndon–Schützenberger result to pseudoperiodic words
AbstractOne 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). Thus, any expression consisting of repetitions of u and θ(u) can be considered in some sense periodic. In this paper, we give a generalization of Lyndon and Schützenberger’s classical result about equations of the form ul=vnwm, to cases where both sides involve repetitions of words as well as their complements. Our main results show that, for such extended equations, if l⩾5,n,m⩾3, then all three words involved can be expressed in terms of a common word t and its complement θ(t). Moreover, if l⩾5, then n=m=3 is an optimal bound. These results are established based on a complete characterization of all possible overlaps between two expressions that involve only some word u and its complement θ(u), which is also obtained in this paper
On the Combinatorics of Palindromes and Antipalindromes
We prove a number of results on the structure and enumeration of palindromes
and antipalindromes. In particular, we study conjugates of palindromes,
palindromic pairs, rich words, and the counterparts of these notions for
antipalindromes.Comment: 13 pages/ submitted to DLT 201
Double String Tandem Repeats
A tandem repeat is an occurrence of two adjacent identical substrings. In this paper, we introduce the notion of a double string, which consists of two parallel strings, and we study the problem of locating all tandem repeats in a double string. The problem introduced here has applications beyond actual double strings, as we illustrate by solving two different problems with the algorithm of the double string tandem repeats problem. The first problem is that of finding all corner-sharing tandems in a 2-dimensional text, defined by Apostolico and Brimkov. The second problem is that of finding all scaled tandem repeats in a 1d text, where a scaled tandem repeat is defined as a string UU\u27 such that U\u27 is discrete scale of U. In addition to the algorithms for exact tandem repeats, we also present algorithms that solve the problem in the inexact sense, allowing up to k mismatches. We believe that this framework will open a new perspective for other problems in the future
Powers in a class of A-strict standard episturmian words
This paper concerns a specific class of strict standard episturmian words
whose directive words resemble those of characteristic Sturmian words. In
particular, we explicitly determine all integer powers occurring in such
infinite words, extending recent results of Damanik and Lenz (2003), who
studied powers in Sturmian words. The key tools in our analysis are canonical
decompositions and a generalization of singular words, which were originally
defined for the ubiquitous Fibonacci word. Our main results are demonstrated
via some examples, including the -bonacci word: a generalization of the
Fibonacci word to a -letter alphabet ().Comment: 26 pages; extended version of a paper presented at the 5th
International Conference on Words, Montreal, Canada, September 13-17, 200