Results 121 to 130 of about 12,413 (296)
Acyclic list edge coloring of outerplanar graphs
, 2013 An acyclic list edge coloring of a graph G is a proper list edge coloring such that no bichromatic cycles are produced. In this paper, we prove that an outerplanar graph G with maximum degree Δ≥5 has the acyclic list edge chromatic number equal to ...
Wang, Weifan, Shu, Qiaojun, Wang, Yiqiao
core +1 more source
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
IMPLEMENTASI ALGORITMA GREEDY UNTUK MELAKUKAN GRAPH COLORING: STUDI KASUS PETA PROPINSI JAWA TIMUR
Jurnal Informatika, 2010 This paper will describe us how to coloring a graph by using greedy algorithm with the case study province of Jawa Timur. From this research we will know that for graph coloring at Jawa Timur Province only use four difference colors.
Ardiansyah Ardiansyah +5 more
doaj +1 more source
Promiscuous stimulation of HSP70 ATPase activity by parasite‐derived J‐domains
FEBS Open Bio, EarlyView.The malaria parasite Plasmodium falciparum exports three highly homologous yet functionally divergent J‐domain proteins into human erythrocytes. Here, we show that J‐domains isolated from all three proteins effectively stimulate the ATPase activity of both endogenous host and exported parasite HSP70 chaperones.
Julian Barth +6 more
wiley +1 more source
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS Open Bio, EarlyView.We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
, 2023 A proper coloring of a graph $G$ is an assignment of colors to all vertices in $G$ so that adjacent vertices receive different colors. In this thesis, we will introduce a generalization of a coloring problem known as DP-coloring.
Minjung Kang
core
FEBS Open Bio, EarlyView.This study investigated a novel WST‐8‐based assay for evaluating d‐Amino acid oxidase (DAO) inhibitors. We confirmed its effectiveness using known inhibitors and found that uremic toxins possess relatively weak inhibitory activity compared to existing drugs.
Kahoko Miyake +4 more
wiley +1 more source
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Screening and epitope characterization of Nidogen‐2‐specific nanobodies
FEBS Open Bio, EarlyView.Camel immunization and phage display were employed to generate high‐affinity VHH nanobodies against Nidogen‐2. After library construction, biopanning, ELISA screening, sequencing, and recombinant expression, selected nanobodies were purified and characterized, leading to the preliminary exploration of a nanobody‐based sandwich ELISA for specific ...
Jianchuan Wen +9 more
wiley +1 more source
Streaming Edge Coloring with Asymptotically Optimal Colors [PDF]
Given a graph G, an edge-coloring is an assignment of colors to edges of G such that any two edges sharing an endpoint receive different colors. By Vizing’s celebrated theorem, any graph of maximum degree Δ needs at least Δ and at most (Δ + 1) colors to ...
Behnezhad, Soheil, Saneian, Mohammad
core +1 more source