Results 91 to 100 of about 1,782,235 (292)
Generative Power and Closure Properties of Watson-Crick Grammars
Applied Computational Intelligence and Soft Computing, 2016 We define WK linear grammars, as an extension of WK regular grammars with linear grammar rules, and WK context-free grammars, thus investigating their computational power and closure properties.
Nurul Liyana Mohamad Zulkufli +3 more
doaj +1 more source
FEBS Open Bio, EarlyView.Abruptly changing from aerobic to anaerobic conditions (sudden anaerobization) induced growth inhibition and a significant increase in intracellular labile ferrous iron in the aerotolerant anaerobe Amphibacillus xylanus. We found that free flavins mediate efficient electron transfer from NADH to ferric iron under anaerobic conditions, suggesting that ...
Shinya Kimata +13 more
wiley +1 more source
Theoretical Computer Science, 1987 Let A be a finite alphabet and let r be a symmetrical relation on A. Let us consider the free partially commutative monoid M(A,r) generated by A with respect to r (i.e., the quotient of A * by the congruence relation generated by (ab,ba) for all (a,b) in r).
openaire +2 more sources
FEBS Open Bio, EarlyView.UiO‐66(Zr) metal–organic frameworks are chemically stable, biocompatible, and highly tunable nanomaterials. Their modular structure enables controlled drug delivery, multimodal bioimaging, and light‐activated photodynamic therapy, supporting integrated diagnostic and therapeutic (theranostic) applications in cancer and biomedical research.
Veronika Huntošová +2 more
wiley +1 more source
Cross-sector collaborative activities to promote modern languages in Scotland [PDF]
, 2008 The study was commissioned by The Higher Education Academy Subject Centre for Languages, Linguistics and Area Studies (LLAS). It replicates the study by Davis (2006) on cross-sector activities to promote the study of modern languages in England and Wales,
, Subject Centre Languages, Linguistics and Area Studies (Funder) +2 more
core +3 more sources
Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA
FEBS Open Bio, EarlyView.PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro +1 more
wiley +1 more source
Regular component splittable languages
, 2014 Every infinite regular language contains a regular subset of the form u upsilon(+)ut for some words u,upsilon,w, where upsilon is not the empty word. The regular subsets of the above form are called regular components.
Shyr, H.J., Yu, S.S.
core +1 more source
On Concatenations of Regular Circular Word Languages
MathematicsIn this paper, one-wheel and two-wheel concatenations of circular words and their languages are investigated. One-wheel concatenation is an operation that is commutative but not associative, while two-wheel concatenation is associative but not ...
Bilal Abdallah, Benedek Nagy
doaj +1 more source
FEBS Open Bio, EarlyView.Hyperosmotic stress triggers the relocation of the CFIm complex from the nucleus to the cytoplasm. This shift creates a nuclear ‘stoichiometric bottleneck’, limiting CFIm availability for mRNA processing. Consequently, specific mRNAs like NUDT21 and DICER1 undergo targeted 3′UTR shortening, demonstrating how spatial protein dynamics drive rapid ...
Hitomi Soumiya +2 more
wiley +1 more source
On the periodicity of regular languages
Information and Control, 1979 A subclass of regular languages called periodic languages and the corresponding finite automata having nontrivial periodic structure are characterized in this paper. Canonical forms of the regular expressions representing such periodic languages are presented.
openaire +3 more sources