Results 121 to 130 of about 7,042,445 (296)

Prospecting the protein design landscape

FEBS Letters, EarlyView.
This review outlines the current state of various protein design approaches. We discuss the current possibilities enabled by recently released tools, highlight future avenues to pursue in protein design, and underscore the crucial role of key databases and resources for successful protein design workflows.
Jakob R. Riccabona, Katharina T. Stonig, Jens Meiler, Clara T. Schoeder, Monica L. Fernández‐Quintero   +4 more
wiley   +1 more source

Some results on total domination in direct products of graphs [PDF]

, 2006
International audienceUpper and lower bounds on the total domination number of the direct product of graphs are given. The bounds involve the {2}-total domination number, the total 2-tuple domination number, and the open packing number of the factors ...
Paul Dorbec, Sandi Klavžar, Simon Spacapan, Klavzar, Sandi, Dorbec, Paul, Gravier, Sylvain, Sylvain Gravier, Spacapan, Simon   +7 more
core   +1 more source

RNA‐related functions of BRCA2 in transcription, replication, and genome stability

FEBS Letters, EarlyView.
Beyond its role in homologous recombination, BRCA2 regulates R‐loop homeostasis, DNA–RNA hybrid resolution, RNA polymerase II dynamics, and transcriptional activation. Disruption of any of these functions can contribute to genome instability, inflammatory signaling, and tumorigenesis. BRCA2 is a central tumor suppressor protein best known for its roles
Lucia Alvaro‐Aranda, Sreerama Chaitanya Sridhara, Aura Carreira   +2 more
wiley   +1 more source

Secure domination and secure total domination in graphs

Discussiones Mathematicae Graph Theory, 2008
A secure (total) dominating set of a graph G = (V; E) is a (total) dominating set X V with the property that for each u 2 V X, there exists x 2 X adjacent to u such that (X fxg) [ fug is (total) dominating. The smallest cardinality of a secure (total) dominating set is the secure (total) domination number s(G) ( st(G)).
William Klostermeyer, Christina M. Mynhardt   +1 more
openaire   +1 more source

Complementary total domination in graphs [PDF]

, 2007
Let D be a minimum total dominating set of G. If V−D contains a total dominating set (TDS) say S of G, then S is called a complementary total dominating set with respect to D.
Soner, N.D., Chaluvaraju, B.
core   +1 more source

Artificial molecular machines and motors—Design and control of nanoscale motion

FEBS Letters, EarlyView.
Molecules are constantly moving because of thermal fluctuations, but random motion alone cannot be exploited to perform directional tasks. Artificial molecular machines use chemical, electrical, or light energy to bias this motion. Molecular shuttles, rotary motors, and supramolecular pumps illustrate how nanoscale movement can be controlled and ...
Leonardo Andreoni, Alberto Credi
wiley   +1 more source

Total $k$-distance domination critical graphs [PDF]

Transactions on Combinatorics, 2016
A set $S$ of vertices in a graph $G=(V,E)$ is called a total$k$-distance dominating set if every vertex in $V$ is withindistance $k$ of a vertex in $S$.
Doost Ali Mojdeh, A. Sayed-Khalkhali, Hossein Abdollahzadeh Ahangar, Yancai Zhao   +3 more
doaj  

The heterodimeric amino acid transporters (HAT) of the SLC7/SLC3 family: A structure−function relationships and relevance to human pathology

FEBS Letters, EarlyView.
Heterodimeric amino acid transporters consist of SLC7 and SLC3 family proteins arranged in a conserved structural organization. They regulate nutrient transport across cell membranes, supporting essential cellular functions. These transporters also contribute to xenobiotic/drug uptake and distribution.
Mariafrancesca Scalise, Tiziano Mazza, Raffaella Scanga, Lara Console, Michele Galluccio, Cesare Indiveri   +5 more
wiley   +1 more source

Orientable total domination in graphs

Discrete Applied Mathematics
Given a directed graph $D$, a set $S \subseteq V(D)$ is a total dominating set of $D$ if each vertex in $D$ has an in-neighbor in $S$. The total domination number of $D$, denoted $γ_t(D)$, is the minimum cardinality among all total dominating sets of $D$. Given an undirected graph $G$, we study the maximum and minimum total domination numbers among all
Anderson, Sarah E, matematika, Dravec, Tanja, Johnston, Daniel, Kuenzel, Kirsti   +3 more
openaire   +4 more sources

Leucine‐rich glioma inactivated 1 (LGI1) is a ganglioside‐binding protein

FEBS Letters, EarlyView.
Neuronal hyperexcitability associated with a decrease/absence of the extracellular protein LGI1 has been suggested to be primarily due to the downregulation of Kv1 channel expression. The molecular mechanisms underlying this decrease have not yet been elucidated.
Kévin Debreux, Christian Lévêque, Fodil Azzaz, Marion Sangiardi, Sarosh R Irani, Michael Seagar, Jacques Fantini, Oussama El Far   +7 more
wiley   +1 more source