Results 281 to 290 of about 77,661 (325)
Some of the next articles are maybe not open access.
Palindrome and palindrome-like sequences of herpes simplex virus DNA
Virology, 1978Abstract Herpes simplex virus (HSV) DNA has been denatured, neutralized, and allowed to renature for very short periods of time. Under these conditions the rapid first-order foldback reaction occurred. Where there were palindrome or palindrome-like sequences on the duplex HSV DNA, corresponding stems or stem-and-loop structures appeared on the single-
Richard W. Hyman, Roger H. Miller
openaire +3 more sources
BioEssays, 2022
AbstractIn human languages, a palindrome reads the same forward as backward (e.g., ‘madam’). In regulatory DNA, a palindrome is an inverted sequence repeat that allows a transcription factor to bind as a homodimer or as a heterodimer with another type of transcription factor.
Rhea R. Datta, Jens Rister
openaire +2 more sources
AbstractIn human languages, a palindrome reads the same forward as backward (e.g., ‘madam’). In regulatory DNA, a palindrome is an inverted sequence repeat that allows a transcription factor to bind as a homodimer or as a heterodimer with another type of transcription factor.
Rhea R. Datta, Jens Rister
openaire +2 more sources
Palindromes in linear recurrence sequences
Monatshefte für Mathematik, 2013We prove that for any base \(b\ge 2\) and for any linear homogeneous recurrence sequence \(\{a_n\}_{n\ge 1}\) satisfying certain conditions, there exits a positive constant \(c>0\) such that \(\# \{n\le x:\ a_n \;\text{ is} \text{ palindromic} \text{ in} \text{ base}\; b\} \ll x^{1-c}\).
Javier Cilleruelo +2 more
openaire +2 more sources
Palindromes in Lucas Sequences
Monatshefte f�r Mathematik, 2003Say that \(\{w_n\}\) is a Lucas sequence if \(w_{n+2}= rw_{n+1}+sw_n\) where \(s\neq 0\) and \(r^2+4s\neq 0\). An integer is called a palindrome to base \(b\) if the base \(b\) representation of the integer is left unchanged when the digits are reversed. Let \(P(x)\) denote the number of integers \(n\leq x\) such that \(w_n\) is a base \(b\) palindrome.
openaire +3 more sources
Identification and Analysis of Palindromes for RNA Sequences
2016 IEEE 16th International Conference on Bioinformatics and Bioengineering (BIBE), 2016A palindrome is a string of the form S = A1 A2 or S = A1 aA2, where A1 and A2 are substrings of S and the reverse of A2 exactly matches with A1. DNA palindromes show direct influence on tumerogenesis due to the formation of DNA palindromes at microRNA genes, which involve in tumor development. Furthermore, RNA palindromes play a crucial role in genomic
Chien-Hung Huang +6 more
openaire +2 more sources
Genetic Instability of an Artificial Palindrom DNA Sequence
Journal of Biomolecular Structure and Dynamics, 1983A short DNA palindrom, produced by head to head ligation of a 29 bp DNA fragment, was inserted into a 27,000 bp plasmid DNA element composed of two functional replicons (R6K, ColE1). Several plasmid types containing a single copy of this palindrom in different locations of insertion on the R6K sequence were obtained.
Israel Hertman +2 more
openaire +2 more sources
Palindromes and Two-Dimensional Sturmian Sequences
2001Journal of Automata, Languages and Combinatorics, Volume 6, Number 2, 2001, 121 ...
Berthé, Valérie, Vuillon, Laurent
openaire +2 more sources
On Palindromic Sequence Automata and Applications
2013In this paper, we present a novel weighted finite automata called PSA (Palindromic Subsequence Automata) that is a compact representation of all the palindromic subsequences of a string. Then we use PSA to solve the LCPS (Longest Common Palindromic Subsequence) problem. Our automata based algorithms are efficient both in theory and in practice.
Ayon Sen +3 more
openaire +2 more sources
On Palindromic Length of Sturmian Sequences
2019Frid, Puzynina and Zamboni (2013) defined the palindromic length of a finite word w as the minimal number of palindromes whose concatenation is equal to w. For an infinite word \(\varvec{u}\) we study \(\mathrm {pal}_{\varvec{u}}\), that is, the function that assigns to each positive integer n, the maximal palindromic length of factors of length n in \(
Petr Ambrož, Edita Pelantová
openaire +2 more sources