Results 11 to 20 of about 464,630 (244)

Yeast Gcn2 retains activity following humanization of its auto-phosphorylation region. [PDF]

open access: yesFEBS Open Bio
Using Saccharomyces cerevisiae as a model to study Gcn2 activation and regulation is limited by the lack of antibodies detecting phosphorylated Gcn2. To overcome this, we engineered Gcn2‐HsC, a yeast Gcn2 variant recognizable by commercial anti‐human phospho‐GCN2 antibodies.
Anderson RA, Schiemann AH, Sattlegger E.
europepmc   +2 more sources

A Summability Factor Theorem Involving an Almost Increasing Sequence for Generalized Absolute Summability

open access: yesComputers and Mathematics With Applications, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +4 more sources

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences

open access: yesLecture Notes in Computer Science
Let $A$ and $B$ be two number sequences of length $n$ and $m$, respectively, where $m\le n$. Given a positive number $δ$, a common almost increasing sequence $s_1\ldots s_k$ is a common subsequence for both $A$ and $B$ such that for all $2\le i\le k$, $s_i+δ> \max_{1\le j < i} s_j$.
Debajyoti Mondal, Md Manzurul Hasan
exaly   +5 more sources

Variability and trend of changes in the severity-area of drought and wet in Iran [PDF]

open access: yesمخاطرات محیط طبیعی, 2023
This study aims to investigate the variability and trend of changes in area severity of wet and drought on annual, seasonal, and monthly scales in Iran.
Mostafa Karimi, Sousan Heidari
doaj   +1 more source

The decay of the refocused Hahn echo in double electron–electron resonance (DEER) experiments [PDF]

open access: yesMagnetic Resonance, 2021
Double electron–electron resonance (DEER) is a pulse electron paramagnetic resonance (EPR) technique that measures distances between paramagnetic centres. It utilizes a four-pulse sequence based on the refocused Hahn spin echo.
T. Bahrenberg   +4 more
doaj   +1 more source

Deciphering the RRM-RNA recognition code: A computational analysis.

open access: yesPLoS Computational Biology, 2023
RNA recognition motifs (RRM) are the most prevalent class of RNA binding domains in eucaryotes. Their RNA binding preferences have been investigated for almost two decades, and even though some RRM domains are now very well described, their RNA ...
Joel Roca-Martínez   +3 more
doaj   +1 more source

The probabilistic number theory and continuum

open access: yesLietuvos Matematikos Rinkinys, 1999
Let bn be a sequence of real numbers increasing unboundedly, α > 0 and B(n, α) = [bn α]. The conditions on bn are considered, which imply the regularity of distribution of B(n, α) in arithmetic prog­ressions for almost all α > 0.
Vilius Stakėnas
doaj   +3 more sources

A new factor theorem for generalized absolute Riesz summability

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2019
The aim of this paper is to consider an absolute summability method and generalize a theorem concerning $\left|\bar{N},p_{n}\right|_{k}$ summability of infinite series to ${\varphi-\mid{\bar{N},p_n;\delta}\mid}_k$ summability of infinite series by using ...
A. Karakaş
doaj   +1 more source

A Theorem on Absolute Summability of Infinite Series

open access: yesCumhuriyet Science Journal, 2019
Inthis paper, a theorem on absolute summability of infinite series is obtained bytaking almost increasing sequence instead of positive non-decreasing sequence.Also, some results of absolute summability are given.
Bağdagül Kartal
doaj   +1 more source

A New Application of Almost Increasing Sequences

open access: yesAnnals of the Alexandru Ioan Cuza University - Mathematics, 2015
Abstract Bor has proved a main theorem dealing with | N̄ , pn|k summability factors of infinite series. In this paper, we have generalized this theorem to the φ − |A, pn|k summability factors, under weaker conditions by using an almost increasing sequence instead of a positive monotonic non-decreasing sequence.
Keten, Ayşegül, Özarslan, Hikmet
openaire   +2 more sources

Home - About - Disclaimer - Privacy