Paper Info
Title
A relation by palindromic subwords
Abstract
We define a new relation on words by a finite series of insertions and/or deletions of palindromic subwords. In particular we concentrate on insertion or deletion of Watson---Crick palindromes. We show that the new relation ~驴 is, in fact, an equivalence relation where 驴 is any arbitrary antimorphic involution that is not the identity on the letters of the alphabet. We also show that the set of all 驴-palindromic free words defined in (Daley et al. in preparation) is ~驴-independent. Using the relation we define a new subclass of primitive words which we call as ~驴-primitive words and show that the class of all ~驴-primitive words is closed under circular permutations. We also define ~驴-conjugates and ~驴-commutativity and study the properties of such words and show that they are similar to that of conjugate words and words that commute.
Year
DOI
Venue
2010
10.1007/s11047-010-9179-z
Natural Computing
Keywords
DocType
Volume
DNA encodings,Combinatorics of words,Palindromes,Insertion/deletion,Watson–Crick palindromes
Journal
9
Issue
ISSN
Citations 
4
1567-7818
0
PageRank 
References 
Authors
0.34
7
2
Name
Order
Citations
PageRank
Mark Daley116622.18
Kalpana Mahalingam213521.42