Results 41 to 50 of about 286,443 (288)

Mapping the evolution of mitochondrial complex I through structural variation

open access: yesFEBS 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

Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2015
Given graphs G and H, a vertex coloring c : V (G) →ℕ is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ (H,G), is the minimum number of colors in an H-free coloring of G.
Kubicka Ewa   +2 more
doaj   +1 more source

Utilisation d’un adhésif  à polymérisation UV  pour combler les surfaces  lacunaires d’objets d’art en verre ou à revêtements vitreux

open access: yesCeROArt : Conservation, Exposition, Restauration d'Objets d'Art, 2015
This research proposes a method for fill areas of loss on glazed objects and objects with a vitreous coating (ceramics, enamels on metal supports) and for. replace colored epoxy resin with a UV curing adhesive.
Viviane Bechoux   +3 more
doaj   +1 more source

The Influence of Light and Color in Digital Paintings of Environmental Issues on Emotions and Cognitions

open access: yesInformatics, 2023
This study aimed to examine the use of light and color in digital paintings and their effect on audiences’ perceptions of environmental issues. Five digital paintings depicting environmental issues have been designed.
Witthaya Hosap   +4 more
doaj   +1 more source

Message passing for the coloring problem: Gallager meets Alon and Kahale

open access: yes, 2007
Message passing algorithms are popular in many combinatorial optimization problems. For example, experimental results show that {\em survey propagation} (a certain message passing algorithm) is effective in finding proper $k$-colorings of random graphs ...
Ben-Shimon, Sonny, Vilenchik, Dan
core   +3 more sources

The anti‐CRISPR protein AcrIE8.1 inhibits the type I‐E CRISPR‐Cas system by directly binding to the Cascade subunit Cas11

open access: yesFEBS Letters, EarlyView.
In this study, we present the structure of AcrIE8.1, a previously uncharacterized anti‐CRISPR protein that inhibits the type I‐E CRISPR‐Cas system. Through a combination of structural and biochemical analyses, we demonstrate that AcrIE8.1 directly binds to the Cas11 subunit of the Cascade complex to inhibit the CRISPR‐Cas system.
Young Woo Kang, Hyun Ho Park
wiley   +1 more source

Analysis of Pigmentation Changes in Bracts of Bougainvillea × buttiana ‘Miss Manila’ During Different Developmental Periods

open access: yesBiology
Bougainvillea has large and vibrant-colored bracts, which are widely used in landscape gardening. In order to study the changing pattern of pigmentation and the expression of genes related to pigment synthesis during different developmental periods of ...
Xiangdong Liu   +7 more
doaj   +1 more source

A sufficient condition for bicolorable hypergraphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2005
In this note we prove Sterboul's conjecture, that provides a sufficient condition for the bicolorability of hypergraphs.
David Défossez
doaj   +1 more source

Upaya Peningkatan Kreativitas Anak Usia Dini melalui Kegiatan Menggambar dan Mewarnai Tote Bag di Dusun Ngadirejo Wetan, Desa Pondok, Kecamatan Ngadirojo, Kabupaten Wonogiri

open access: yesAgriHealth, 2022
Childhood is the most important period because it is the formation of the personality foundation that determines the next child's experience. Creativity can increase productivity, quality of life and the ability to solve a problem.
Ferry Rachmanto   +10 more
doaj   +1 more source

Total coloring of 1-toroidal graphs of maximum degree at least 11 and no adjacent triangles

open access: yes, 2018
A {\em total coloring} of a graph $G$ is an assignment of colors to the vertices and the edges of $G$ such that every pair of adjacent/incident elements receive distinct colors.
AV Kostochka   +16 more
core   +1 more source

Home - About - Disclaimer - Privacy