Results 61 to 70 of about 1,439,443 (264)
Mapping the evolution of mitochondrial complex I through structural variation
FEBS Letters, EarlyView.Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin +2 more
wiley +1 more source
Distinguishing number and distinguishing index of neighbourhood corona of two graphs
Contributions to Discrete Mathematics, 2019 The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. The neighbourhood corona of two graphs $G_1$ and $G_2$ is denoted by $G_1 \star G_2$ and is the graph obtained by taking one copy of ...
Alikhani, Saeid, Soltani, Samaneh
openaire +3 more sources
FEBS Letters, EarlyView.Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
On the Distance Pattern Distinguishing Number of a Graph
Journal of Applied Mathematics, 2014 Let G=(V,E) be a connected simple graph and let M be a nonempty subset of V. The M-distance pattern of a vertex u in G is the set of all distances from u to the vertices in M.
Sona Jose, Germina K. Augustine
doaj +1 more source
A classification model for distinguishing copy number variants from cancer-related alterations
BMC Bioinformatics, 2010 Background Both somatic copy number alterations (CNAs) and germline copy number variants (CNVs) that are prevalent in healthy individuals can appear as recurrent changes in comparative genomic hybridization (CGH) analyses of tumors.
Olshen Adam B +2 more
doaj +1 more source
Distinguishing Number of Countable Homogeneous Relational Structures [PDF]
The Electronic Journal of Combinatorics, 2010 The distinguishing number of a graph $G$ is the smallest positive integer $r$ such that $G$ has a labeling of its vertices with $r$ labels for which there is no non-trivial automorphism of $G$ preserving these labels. In early work, Michael Albertson and Karen Collins computed the distinguishing number for various finite graphs, and more recently ...
Laflamme, C. +2 more
openaire +3 more sources
Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation
FEBS Letters, EarlyView.Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe +3 more
wiley +1 more source
All Graphs of Order n with Distinguishing Number n−1 or n − 2
Theory and Applications of GraphsLet G be a simple connected graph. The distinguishing number of G, denoted by D(G), is the least integer d such that G has a vertex d-labeling preserved only by the trivial automorphism.
Andi Pujo Rahadi +2 more
doaj +1 more source
Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)
Discussiones Mathematicae Graph Theory, 2013 Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring
Chen Xiang’en, Gao Yuping, Yao Bing
doaj +1 more source
Well‐quasi‐ordering and finite distinguishing number [PDF]
Journal of Graph Theory, 2019 AbstractBalogh, Bollobás and Weinreich showed that a parameter that has since been termed the distinguishing number can be used to identify a jump in the possible speeds of hereditary classes of graphs at the sequence of Bell numbers. We prove that every hereditary class that lies above the Bell numbers and has finite distinguishing number contains a ...
Aistis Atminas, Robert Brignall
openaire +3 more sources