Splicing semigroups of dominoes and DNA
Discrete Mathematics
Handbook of formal languages, vol. 1
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
On the combinatorics of finite words
Theoretical Computer Science
Partial words and a theorem of Fine and Wilf
Theoretical Computer Science
Partial words and a theorem of Fine and Wilf revisited
Theoretical Computer Science
Local periods and binary partial words: an algorithm
Theoretical Computer Science
Partial words and the critical factorization theorem
Journal of Combinatorial Theory Series A
Codes, orderings, and partial words
Theoretical Computer Science
Discrete Applied Mathematics
Testing primitivity on partial words
Discrete Applied Mathematics
Theoretical Computer Science
Discrete Applied Mathematics
Watson-Crick conjugate and commutative words
DNA13'07 Proceedings of the 13th international conference on DNA computing
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The three-squares lemma for partial words with one hole
Theoretical Computer Science
| Hi-index | 5.23 |
The study of the combinatorial properties of strings of symbols from a finite alphabet (also referred to as words) is profoundly connected to numerous fields such as biology, computer science, mathematics, and physics. In this paper, we examine to which extent some fundamental combinatorial properties of words, such as conjugacy, remain true for partial words. The motivation behind the notion of a partial word is the comparison of two genes (alignment of two such strings can be viewed as a construction of two partial words that are said to be compatible). This study on partial words was initiated by Berstel and Boasson.