Results 81 to 90 of about 91,504 (262)
The problem of error-tolerant Graph Matching (GM) computation is proposed under time and memory constraints.We propose to define a third category for anytime GM methods.We convert an exact graph edit distance method into an anytime one.The proposed algorithm finds an initial solution quickly and continues to improve it towards an optimal solution.Our ...
Abu-Aisheh, Zeina +2 more
openaire +3 more sources
We investigated the toxicity of 12 active compounds commonly found in herbal weight loss supplements (WLS) using human liver and colon cell models. Epigallocatechin‐3‐gallate was the only compound showing significant toxicity. Metabolic profiling revealed protein degradation, disrupted energy and lipid metabolism suggesting that the inclusion of EGCG ...
Emily C. Davies +3 more
wiley +1 more source
Intelligent Performance Evaluation in Rowing Sport Using a Graph-Matching Network. [PDF]
Chen CC +5 more
europepmc +1 more source
CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point +7 more
wiley +1 more source
EAGMN: Coronary artery semantic labeling using edge attention graph matching network. [PDF]
Zhao C, Xu Z, Hung GU, Zhou W.
europepmc +1 more source
dUTPases are involved in balancing the appropriate nucleotide pools. We showed that dUTPase is essential for normal development in zebrafish. The different zebrafish genomes contain several single‐nucleotide variations (SNPs) of the dut gene. One of the dUTPase variants displayed drastically lower protein stability and catalytic efficiency as compared ...
Viktória Perey‐Simon +6 more
wiley +1 more source
Commuting decomposition of Kn1,n2,...,nk through realization of the product A(G)A(GPk )
In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GPk , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GPk ) is ...
Bhat K. Arathi, Sudhakara G.
doaj +1 more source
Graph matching using conformal module
Graph matching and classification play fundamental roles in computer vision. The computational complexity of the conventional method based on a spectrum method is high, which prevents it from handling large graphs in practice.
Jialing Zhang, Kun Qian
doaj +1 more source
Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching
NIPS ...
Fiori, Marcelo +4 more
openaire +2 more sources
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

