Results 71 to 80 of about 418,956 (263)

Strongly regular modules

Discussiones Mathematicae - General Algebra and Applications, 2023
Govindarajulu Narayanan Sudharshana, Duraisamy Sivakumar   +1 more
doaj   +1 more source

Cell geometry and membrane protein crowding constrain Escherichia coli growth rate, overflow metabolism, respiration, and maintenance energy

FEBS Letters, EarlyView.
The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson, Tomáš Gedeon, Mauricio Garcia Benitez, Campbell Putnam, William R. Harcombe, Radhakrishnan Mahadevan, Ashley E. Beck   +6 more
wiley   +1 more source

Design and analysis strategies for robust microbiome ageing research

FEBS Letters, EarlyView.
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik, İsmail Güderer, Yi Wang, Tayyaba Alvi, Prasoon Pandey, Handan Melike Dönertaş   +5 more
wiley   +1 more source

GRAPHS \(\Gamma\) OF DIAMETER 4 FOR WHICH \(\Gamma_{3,4}\) IS A STRONGLY REGULAR GRAPH WITH \(\mu=4,6\)

Ural Mathematical Journal
We consider antipodal graphs \(\Gamma\) of diameter 4 for which  \(\Gamma_{1,2}\) is a strongly regular graph. A.A. Makhnev and D.V. Paduchikh noticed that, in this case, \(\Delta=\Gamma_{3,4}\) is a strongly regular graph without triangles.
Alexander A. Makhnev, Mikhail P. Golubyatnikov, Konstantin S. Efimov   +2 more
doaj   +1 more source

RAMANUJAN POLAR GRAPHS [PDF]

Journal of Algebraic Systems
Recently, a construction of minimal codes arising from a family of almost Ramanujan graphs was shown. Ramanujan graphs are examples of expander graphs that minimize the second-largest eigenvalue of their adjacency matrix.
Valentino Smaldore
doaj   +1 more source

Identification of the plant mitochondrial OrfX protein: A mass spectrometry approach

FEBS Letters, EarlyView.
The mitochondrial genome of plants contains an open reading frame, orfx, which encodes a rare protein that has so far escaped mass spectrometric detection. The protein resembles the c‐subunit of bacterial twin‐arginine‐motif‐dependent protein translocases (TatC).
Matthias Döring, Jan de Jonge, Hans‐Peter Braun, Nils Rugen   +3 more
wiley   +1 more source

Statistically strongly regular matrices and some core theorems

International Journal of Mathematics and Mathematical Sciences, 2003
We define the statistically strongly regular matrices analogous to the strongly regular matrices, and further we use these matrices to establish necessary and sufficient conditions to prove some core theorems.
M. Mursaleen, Osama H. H. Edely
doaj   +1 more source

An epithelial GPR35 isoform supports tumor‐associated transcriptional and metabolic phenotypes

FEBS Letters, EarlyView.
GPR35 generates two functionally distinct isoforms with previously unresolved roles. GPR35‐short mediates immune‐cell chemotaxis, while GPR35‐long is enriched in colorectal cancer epithelium, where it supports increased metabolism, proliferation, and tumor‐associated transcriptional programs.
Jørgen D. Rønneberg, Martine Hjeltnes, Josephine Krieger, Joshua E. Elias, Maria Stensland, Kristian Holm, Xiaojun Jiang, Chuki Khangsar, Tuula A. Nyman, Arthur Kaser, Johannes R. Hov, Tom H. Karlsen, Nicole C. Kaneider, Frode L. Jahnsen, Georg Schneditz   +14 more
wiley   +1 more source

Strongly Involution k-regular nil clean ring

NTU Journal of Pure Sciences
This article is about A-rings R, for which every element is a sum of an involution k-regular element and a nilpotent element, which commute with each other. These rings are called strongly involution k-regular nil-clean rings or SIKRNC rings.
Ali Shakir Mahmood, Zubaida Mohammed Ibraheem   +1 more
doaj   +1 more source

Distance-Regular Graphs with Strongly Regular Subconstituents [PDF]

Journal of Algebraic Combinatorics, 1997
The main result of the article is a theorem about distance-regular graphs of diameter \(d\geq 3\) with all subconstituents being strongly regular graphs. The author shows that these are precisely the Taylor graphs \((d=3\) and \(|\Gamma_3 (u) |=1)\) or graphs with \(a_1= 0\), \(a_i\leq 1\) for \(2\leq i\leq d\).
openaire   +2 more sources