Results 161 to 170 of about 2,912,653 (308)
A transposon-related palindromic repetitive sequence from C. elegans.
A family of transposon-like sequences in the C. elegans genome is described. This family, termed the Tc6 family, consists mostly of conserved, 1.6 kb elements.
David H. Dreyfus, S. W. Emmons
semanticscholar +1 more source
Scenarios of drug exposure and administration as well as detection assays for drugs and methods of sports doping published between 2023 and 2024 are critically reviewed and evaluated in context with the Prohibited List 2024 as established by the World Anti‐Doping Agency.
Mario Thevis+2 more
wiley +1 more source
Estimate the Occurrence Rate of the DNA Palindromes [PDF]
A DNA palindrome is a segment of double-stranded DNA sequence with inver- sion symmetry which may form secondary structures conferring significant biolog- ical functions ranging from RNA transcription to DNA replication. To test if the clusters of DNA palindromes distribute randomly is an interesting bioinformatic problem, where the occurrence rate of ...
arxiv
Electrochemical sensing strategies for on‐site testing of pathogenic nucleic acids
Abstract Rapid and reliable on‐site pathogen testing is crucial for diagnosing and managing human health. Nucleic acids (NAs) containing genetic information are valuable target molecules for pathogen testing, and sensitive and rapid detection of NAs using electrochemical approaches has been intensively investigated.
Yusuke Kanno+4 more
wiley +1 more source
Livestock-associated Methicillin-Resistant Staphylococcus aureus Sequence Type 398 in Humans, Canada
Rates of colonization with livestock-associated methicillin-resistant Staphylococcus aureus (MRSA) sequence type 398 have been high for pigs and pig farmers in Canada, but prevalence rates for the general human population are unknown. In this study, 5 LA-
George R. Golding+11 more
doaj +1 more source
Finding Approximate Palindromes in Strings Quickly and Simply [PDF]
Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)-space and almost always runs in $O(k.n)$-time where n is the length of the string and k is the number of ``errors'' allowed in the palindrome. Its worst-case time-complexity is $O(n^2)$ but this does not occur with
arxiv
Genome manipulation has become more accessible given the advent of the CRISPR (Clustered Regularly Interspaced Short Palindromic Repeats) editing technology.
Rachael Giersch, Gregory Finnigan
doaj +1 more source
Palindromic continued fractions [PDF]
In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of continued fraction expansions, including expansions with unbounded partial quotients.
arxiv
Perrin numbers that are palindromic concatenations of two repdigits [PDF]
Let $ \{P_n\}_{n\geq 0} $ be the sequence of Perrin numbers defined by $P_0=3$, $P_1=0$,$P_2=2$ and $P_{n+3}=P_{n+1}+P_{n}$ for all $n \geq 0$. In this paper, we determine all Perrin numbers that are palindromic concatenations of two repdigits.
arxiv +1 more source
The telomeres of Streptomyces chromosomes contain conserved palindromic sequences with potential to form complex secondary structures [PDF]
Chih‐Hung Huang+4 more
openalex +1 more source