Theta Palindromes in Theta Conjugates

Mahalingam, Kalpana; Pandoh, Palak; Maity, Anuran

doi:10.1007/978-3-030-63000-3_12

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

2023

Publication Types

Select...

Other1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Inversions, insertions, deletions, duplications, substitutions and translocations are some of the operations that transform a DNA sequence from a primitive sequence (see [5,6,9,20]). A rearrangement of chromosomes can happen when a single sequence undergoes breakage and one or more segments of the chromosome are shifted by some form of dislocation ( [9]).…”

Section: Introductionmentioning

confidence: 99%

Rich Words in the Block Reversal of a Word

Mahalingam¹,

Maity²,

Pandoh³

2023

Preprint

View full text Add to dashboard Cite

The block reversal of a word w, denoted by BR(w), is a generalization of the concept of the reversal of a word, obtained by concatenating the blocks of the word in the reverse order. We characterize non-binary and binary words whose block reversal contains only rich words. We prove that for a binary word w, richness of all elements of BR(w) depends on l(w), the length of the run sequence of w. We show that if all elements of BR(w) are rich, then 2 ≤ l(w) ≤ 8. We also provide the structure of such words.

show abstract

Section: Introductionmentioning

confidence: 99%

Rich Words in the Block Reversal of a Word

Mahalingam¹,

Maity²,

Pandoh³

2023

Preprint

View full text Add to dashboard Cite

show abstract

HV-Palindromes in Two-Dimensional Words

Mahalingam

Pandoh

2022

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

A two-dimensional (2D) word is a 2D palindrome if it is equal to its reverse and it is an HV-palindrome if all its columns and rows are 1D palindromes. We characterize such words and study some of their combinatorial and structural properties. We also find the number of possible palindromic conjugates of a 2D word. We investigate an upper bound on the number of distinct non-empty HV-palindromic subwords in any finite 2D word, thus, proving the conjecture given by Anisiu et al. We also identify the minimum number of HV-palindromic subwords in an infinite 2D word over a finite alphabet.

show abstract

Theta Palindromes in Theta Conjugates

Cited by 2 publications

References 14 publications

Rich Words in the Block Reversal of a Word

Rich Words in the Block Reversal of a Word

HV-Palindromes in Two-Dimensional Words

Contact Info

Product

Resources

About