Results 1  10
of
1,507
Palindromic richness
 Eur. J. Comb
"... 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 socalled rich words is that all complete returns to any palindromic factor are themselves palindromes. These ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
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 socalled rich words is that all complete returns to any palindromic factor are themselves palindromes
Finding palindromes: variants and algorithms
"... Abstract. The problem of finding palindromes in strings appears in many variants: find exact palindromes, ignore punctuation in palindromes, require space around palindromes, etc. This paper introduces several predicates that represent variants of the problem of finding palindromes in strings. It al ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The problem of finding palindromes in strings appears in many variants: find exact palindromes, ignore punctuation in palindromes, require space around palindromes, etc. This paper introduces several predicates that represent variants of the problem of finding palindromes in strings
Words with many palindrome pair factors
"... Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the property that for infinitely many n, every lengthn factor is a product of two palindromes. We show that every Sturmian word has this property, but this does not characterize the class of Sturmian words ..."
Abstract
 Add to MetaCart
words. We also show that the Thue–Morse word does not have this property. We investigate finite words with the maximal number of distinct palindrome pair factors and characterize the binary words that are not palindrome pairs but have the property that every proper factor is a palindrome pair. 1
Parallel Detection of all Palindromes in a String
 Comput. Sci
, 1994
"... This paper presents two efficient concurrentread concurrentwrite parallel algorithms that find all palindromes in a given string: 1. An O(log n) time, nprocessor algorithm over general alphabets. In case of constant size alphabets the algorithm requires only n= log n processors, and thus achieve ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
This paper presents two efficient concurrentread concurrentwrite parallel algorithms that find all palindromes in a given string: 1. An O(log n) time, nprocessor algorithm over general alphabets. In case of constant size alphabets the algorithm requires only n= log n processors, and thus
Palindromic richness for languages invariant under more symmetries
"... For a given finite group G consisting of morphisms and antimorphisms of a free monoid A∗, we study infinite words with language closed under the group G. We focus on the notion of Grichness which describes words rich in generalized palindromic factors, i.e., in factors w satisfying Θ(w) = w for so ..."
Abstract
 Add to MetaCart
For a given finite group G consisting of morphisms and antimorphisms of a free monoid A∗, we study infinite words with language closed under the group G. We focus on the notion of Grichness which describes words rich in generalized palindromic factors, i.e., in factors w satisfying Θ(w) = w
Searching Gapped Palindromes in DNA Sequences using Dynamic Suffix Array
"... Background/Objectives: In the biological sequences, palindromes can create structures that differ from the common structure of nonpalindromic sequences. Unfortunately, mutations introduced by evolutionary methods, make it difficult to search the palindromes in DNA sequences. Methods/Statistical Ana ..."
Abstract
 Add to MetaCart
. The execution time, palindrome weight and length of palindrome arms and spacer are analysed. Findings: Our proposed algorithms search maximal length constrained and long armed gapped palindromes in DNA sequences efficiently. Time complexity of our proposed algorithms is O(n), where n is input parameters. Also
Counting NonIsomorphic Maximal Independent Sets of the nCycle Graph
"... The number of maximal independent sets of the ncycle graph Cn is known to be the nth term of the Perrin sequence. The action of the automorphism group of Cn on the family of these maximal independent sets partitions this family into disjoint orbits, which represent the nonisomorphic (i.e., defined ..."
Abstract
 Add to MetaCart
The number of maximal independent sets of the ncycle graph Cn is known to be the nth term of the Perrin sequence. The action of the automorphism group of Cn on the family of these maximal independent sets partitions this family into disjoint orbits, which represent the nonisomorphic (i
Results 1  10
of
1,507