Counting (Watson-Crick) palindromes in Watson-Crick conjugates

Mahalingam, Kalpana; Maity, Anuran; Pandoh, Palak

doi:10.1016/j.ic.2021.104863

Cited by 4 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mahalingam, Maity, and Pandoh [15] studied the equality of two θ-conjugates sets and proved the following.…”

Section: Properties Of θ-Conjugatesmentioning

confidence: 97%

“…The concept of conjugacy class of words have been extensively studied in [6,7,13]. Mahalingam, Maity, and Pandoh [15] studied the θ-conjugates of a word and found the distribution of palindromes and θ-palindromes in the set of all θ-conjugates of a word. In this section, we study more combinatorial properties of the set of all θ-conjugates of a word.…”

Section: Properties Of θ-Conjugatesmentioning

confidence: 99%

“…Mahalingam, Maity, and Pandoh [15] characterized the word w such that |C θ (w)| = 1. They proved the following result.…”

Section: Properties Of θ-Conjugatesmentioning

confidence: 99%

“…Watson-Crick palindromes in the set of all θ-conjugates of a word is studied by Mahalingam, Maity, and Pandoh [15]. We study the structure of θ-conjugates of a word.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Watson-Crick conjugates of words and languages

Mahalingam¹,

Maity²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

This paper is a theoretical study of notions in combinatorics of words motivated by information being encoded as DNA strands in DNA computing. We study Watson-Crick conjugates or θ-conjugates, a generalization of the classical notions of conjugates of a word, inspired by biomolecular computing. The Watson-Crick mapping θ is an involution that is also an antimorphism. We study some combinatorial properties of θ-conjugates of a word. We characterize words that have the same set of θ-conjugates. We investigate whether or not the family of certain languages is closed under θ-conjugate operation. We also study the iterated θ-conjugates. We then discuss the concept of θ-conjugate-free language and some decidability problems for θ-conjugate-freeness for different language classes.

show abstract

“…Mahalingam, Maity, and Pandoh [15] studied the equality of two θ-conjugates sets and proved the following.…”

Section: Properties Of θ-Conjugatesmentioning

confidence: 97%

Section: Properties Of θ-Conjugatesmentioning

confidence: 99%

“…Mahalingam, Maity, and Pandoh [15] characterized the word w such that |C θ (w)| = 1. They proved the following result.…”

Section: Properties Of θ-Conjugatesmentioning

confidence: 99%

“…Watson-Crick palindromes in the set of all θ-conjugates of a word is studied by Mahalingam, Maity, and Pandoh [15]. We study the structure of θ-conjugates of a word.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Watson-Crick conjugates of words and languages

Mahalingam¹,

Maity²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…As mentioned in [RS18], eertrees could have potential in Watson-Crick palindromes [KM10,MMP22] and RNA structures [MP05, Str07, MKB + 11, BA15]. In addition, gene editing is an emerging research field in biology (cf.…”

Section: Potential Applications In Bioinformaticsmentioning

confidence: 99%

Double-Ended Palindromic Trees: A Linear-Time Data Structure and Its Applications

Wang¹,

Yang²,

Zhu³

2022

Preprint

View full text Add to dashboard Cite

The palindromic tree (a.k.a. eertree) is a linear-size data structure that provides access to all palindromic substrings of a string. In this paper, we propose a generalized version of eertree, called double-ended eertree, which supports linear-time online double-ended queue operations on the stored string. At the heart of our construction, is a class of substrings, called surfaces, of independent interest. Namely, surfaces are neither prefixes nor suffixes of any other palindromic substrings and characterize the link structure of all palindromic substrings in the eertree.As an application, we develop a framework for range queries involving palindromes on strings, including counting distinct palindromic substrings, and finding the longest palindromic substring, shortest unique palindromic substring and shortest absent palindrome of any substring. In particular, offline queries only use linear space. Apart from range queries, we enumerate palindromic rich strings with a given word in linear time on the length of the given word.

show abstract

Palindromes in involutive Fibonacci arrays

Blasiyus,

Christy

2024

J Supercomput

View full text Add to dashboard Cite

Counting (Watson-Crick) palindromes in Watson-Crick conjugates

Cited by 4 publications

References 16 publications

Watson-Crick conjugates of words and languages

Watson-Crick conjugates of words and languages

Double-Ended Palindromic Trees: A Linear-Time Data Structure and Its Applications

Palindromes in involutive Fibonacci arrays

Contact Info

Product

Resources

About