Results 111 to 120 of about 2,912,554 (209)

A Novel Family of Sequence-specific Endoribonucleases Associated with the Clustered Regularly Interspaced Short Palindromic Repeats*

open access: yesJournal of Biological Chemistry, 2008
Clustered regularly interspaced short palindromic repeats (CRISPRs) together with the associated CAS proteins protect microbial cells from invasion by foreign genetic elements using presently unknown molecular mechanisms.
N. Beloglazova   +13 more
semanticscholar   +1 more source

Counting non-isomorphic maximal independent sets of the n-cycle graph [PDF]

open access: yes, 2007
The number of maximal independent sets of the n-cycle graph C_n is known to be the nth term of the Perrin sequence. The action of the automorphism group of C_n on the family of these maximal independent sets partitions this family into disjoint orbits ...
Bisdorff, Raymond, Marichal, Jean-Luc
core   +5 more sources

CRISPR-Cas9 System as a Versatile Tool for Genome Engineering in Human Cells

open access: yesMolecular Therapy: Nucleic Acids, 2016
Targeted nucleases are influential instruments for intervening in genome revision with great accuracy. RNA-guided Cas9 nucleases produced from clustered regularly interspaced short palindromic repeats (CRISPR)-Cas systems have noticeably altered the ...
Xuelian Wang   +4 more
doaj   +1 more source

Engineer complete resistance to Cotton Leaf Curl Multan virus by the CRISPR/Cas9 system in Nicotiana benthamiana

open access: yesPhytopathology Research, 2019
Clustered, regularly interspaced short palindromic repeats/CRISPR-associated proteins (CRISPR/Cas) based genome editing technology has been developed from the adaptive immune system used by many bacteria and archaea for combating against viruses.
Kangquan Yin   +5 more
doaj   +1 more source

On morphisms preserving palindromic richness [PDF]

open access: yesFundamenta Informaticae, Volume 185, Issue 1 (March 10, 2022) fi:7243, 2020
It is known that each word of length $n$ contains at most $n+1$ distinct palindromes. A finite rich word is a word with maximal number of palindromic factors. The definition of palindromic richness can be naturally extended to infinite words. Sturmian words and Rote complementary symmetric sequences form two classes of binary rich words, while ...
arxiv  

Sequence analysis of deletion mutations at the HPRT locus of human T-lymphocytes: association of a palindromic structure with a breakpoint cluster in exon 2.

open access: yesMutagenesis, 1996
To study the structure and mechanism of deletion mutation in human somatic cells in vivo, we have identified and sequenced the breakpoints of 16 independent deletions at the hypoxanthine-guanine phosphoribosyl transferase (HPRT) locus in human T ...
A. Osterholm   +5 more
semanticscholar   +1 more source

Palindromic sequences in the Saccharomyces cerevisae genome

open access: yes, 2005
abstract
Lisnić, Berislav   +3 more
openaire   +2 more sources

Dimerisation of HIV-2 genomic RNA is linked to efficient RNA packaging, normal particle maturation and viral infectivity

open access: yesRetrovirology, 2007
Background Retroviruses selectively encapsidate two copies of their genomic RNA, the Gag protein binding a specific RNA motif in the 5' UTR of the genome. In human immunodeficiency virus type 2 (HIV-2), the principal packaging signal (Psi) is upstream of
Crowther R Anthony   +3 more
doaj   +1 more source

On Polynomial Pairs of Integers [PDF]

open access: yesJournal of Integer Sequences, Vol. 18 (2015), Article 15.3.5, 2012
The reversal of a positive integer $A$ is the number obtained by reading $A$ backwards in its decimal representation. A pair $(A,B)$ of positive integers is said to be palindromic if the reversal of the product $A \times B$ is equal to the product of the reversals of $A$ and of $B$.
arxiv  

The numbers of repeated palindromes in the Fibonacci and Tribonacci sequences

open access: yes, 2016
The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $ (a,b)=(ab,a)$. Since $\mathbb{F}$ is uniformly recurrent, each factor $ $ appears infinite many times in the sequence which is arranged as $ _p$ $(p\ge 1)$. Here we distinguish $ _p\neq _q$ if $p\neq q$.
Yuke, Huang, Zhiying, Wen
openaire   +2 more sources

Home - About - Disclaimer - Privacy