Results 1 to 10 of about 22,766 (265)
Palindromic permutations and generalized Smarandache palindromic permutations
viXra, 2006 The idea of left(right) palindromic permutations(LPPs,RPPs) and left(right) generalized Smarandache palindromic permutations(LGSPPs,RGSPPs) are introduced in symmetric groups S_n of degree n.
Jaiyeola, Temitope Gbolahan
core +8 more sources
Theoretical Computer Science, 2001 We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points of primitive morphisms of constant length belonging to ...
Jean‐Paul Allouche +3 more
openalex +8 more sources
Journal of the Royal College of Physicians of London, 1981 S Mattingly +4 more
openalex +3 more sources
Discrete Applied Mathematics, 2023 The palindromization map has been defined initially by Aldo de Luca in the context of Sturmian words. It was extended to the free group of rank $2$ by Kassel and the second autho We extend their construction to arbitrary alphabets. We also investigate the suffix automaton and compact suffix automaton of the words obtained by palindromization.
Dominique Perrin, Christophe Reutenauer
openaire +2 more sources
European Journal of Combinatorics, 2009 In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are 'rich' in palindromes in the utmost sense. A characteristic property of so-called "rich words" is that all complete returns to any palindromic factor are themselves palindromes.
Glen, A. +3 more
openaire +2 more sources
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings [PDF]
, 2015 We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the construction of both the suffix trie and suffix tree. Using this structure,
Rubinchik, Mikhail, Shur, Arseny M.
core +1 more source
Detecting Breakage Fusion Bridge cycles in tumor genomes -- an algorithmic approach [PDF]
, 2013 Breakage-Fusion-Bridge (BFB) is a mechanism of genomic instability characterized by the joining and subsequent tearing apart of sister chromatids. When this process is repeated during multiple rounds of cell division, it leads to patterns of copy number ...
Bafna, Vineet +2 more
core +1 more source
Block Palindromes: A New Generalization of Palindromes [PDF]
, 2018 We study a new generalization of palindromes and gapped palindromes called block palindromes. A block palindrome is a string that becomes a palindrome when identical substrings are replaced with a distinct character. We investigate several properties of block palindromes and in particular, study substrings of a string which are block palindromes. In so
Keisuke Goto +3 more
openaire +3 more sources