Results 111 to 120 of about 1,255,445 (300)

Edge-weighting of gene expression graphs [PDF]

open access: yes, 2009
In recent years, considerable research efforts have been directed to micro-array technologies and their role in providing simultaneous information on expression profiles for thousands of genes.
Kerr, Gráinne   +8 more
core   +3 more sources

In silico and in vitro exploration of a tyrosinase for biocatalytic production of catechols

open access: yesFEBS Open Bio, EarlyView.
Tyrosinase from Ralstonia pseudosolanacearum is a promising biocatalyst for producing valuable catechols from monophenol substrates. This tyrosinase is uniquely suited to this due to its high monophenolase : diphenolase ratio. We combined in silico docking and in vivo kinetic characterisation of this tyrosinase with 11 industrially relevant monophenols,
James Britton   +6 more
wiley   +1 more source

Improving Heterogeneous Graph Learning with Weighted Mixed-Curvature Product Manifold [PDF]

open access: yes, 2023
In graph representation learning, it is important that the complex geometric structure of the input graph, e.g. hidden relations among nodes, is well captured in embedding space.
Nguyen-Van, Tuc   +2 more
core   +1 more source

Purification and preparation of Marchantia polymorpha Auxin Response Factor 2 for phase separation studies

open access: yesFEBS Open Bio, EarlyView.
We describe detailed protocols for the purification and preparation of Marchantia polymorpha Auxin Response Factor 2 (MpARF2). This protein is fused to an MBP solubility tag and an mNG fluorescent tag and is purified from Escherichia coli. The presented procedures make it possible to study MpARF2 assemblies, which could arise from phase separation ...
Bas Janssen   +5 more
wiley   +1 more source

Event Coverage Detection and Event Source Determination in Underwater Wireless Sensor Networks

open access: yesSensors, 2015
With the advent of the Internet of Underwater Things, smart things are deployed in the ocean space and establish underwater wireless sensor networks for the monitoring of vast and dynamic underwater environments.
Zhangbing Zhou   +4 more
doaj   +1 more source

Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs

open access: yesSIAM Journal on Matrix Analysis and Applications
Abstract. We extend the notion of nonbacktracking walks from unweighted graphs to graphs whose edges have a nonnegative weight. Here the weight associated with a walk is taken to be the product over the weights along the individual edges. We give two ways to compute the associated generating function, and corresponding node centrality
Francesca Arrigo   +3 more
openaire   +5 more sources

Continuous mean distance of a weighted graph [PDF]

open access: yes, 2023
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances between all pairs of vertices.
Garijo, Delia   +2 more
core  

Protocol for quantifying miRNA trafficking across the endosomal membrane

open access: yesFEBS Open Bio, EarlyView.
An in vitro protocol measures miRNA uptake into endosomes isolated from mammalian cell extracts, which are free of subcellular contaminants. Performed at 37 °C in the presence of ATP, it ensures the import of single‐stranded miRNA into the endosomal lumen.
Syamantak Ghosh   +2 more
wiley   +1 more source

Comparative assessment of crystallographic and cryo‐EM models in the Protein Data Bank

open access: yesFEBS Open Bio, EarlyView.
Raw data obtained by X‐ray crystallography or cryo‐EM result in experimental maps, ultimately fitted by atomic models. Although the physical principles are different, the final results can be viewed, compared, and evaluated in the same way. With cryogenic electron microscopy (cryo‐EM) on track to surpass X‐ray crystallography as the preferred method ...
Alexander Wlodawer   +7 more
wiley   +1 more source

Graph Homomorphism Revisited for Graph Matching [PDF]

open access: yes, 2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong   +4 more
core  

Home - About - Disclaimer - Privacy