Identifying shader sub-patterns for GPU performance tuning and architecture design. [PDF]
Zhao L, Yeo CK, Khan A, Luo R, Jin LP.
europepmc +1 more source
Advancing mRNA subcellular localization prediction with graph neural network and RNA structure. [PDF]
Li F, Bi Y, Guo X, Tan X, Wang C, Pan S.
europepmc +1 more source
QOMIC: quantum optimization for motif identification. [PDF]
Ngo HM, Khatib T, Thai MT, Kahveci T.
europepmc +1 more source
HDBind: encoding of molecular structure with hyperdimensional binary representations. [PDF]
Jones D+9 more
europepmc +1 more source
PyMulSim: a method for computing node similarities between multilayer networks via graph isomorphism networks. [PDF]
Cinaglia P.
europepmc +1 more source
M3NetFlow: A multi-scale multi-hop graph AI model for integrative multi-omic data analysis. [PDF]
Zhang H+8 more
europepmc +1 more source
Heuristic sampling for the subgraph isomorphism problem [PDF]
Subgraph isomorphism is one of the fundamental search problems in computer science. In this article we consider the counting variation of this problem. The task is to count all instances of the pattern G occurring in a (usually larger) graph H. All algorithms for this problem use a variation of backtracking. Most commonly they assign one vertex of G to
Uroš Čibej, Jurij Mihelič
semanticscholar +3 more sources
A QUBO Formulation For the K-densest Common Subgraph Isomorphism Problem Via Quantum Annealing [PDF]
In this paper, we extend the algorithm of [6] to solve the k-densest maximum common subgraph problem. By solving the k-densest maximum common subgraph isomorphism problem, we find high complexity common substructures between input graphs. We prove that our proposed objective function always gives the right answer to the corresponding QUBO problem.
Nan Huang
semanticscholar +3 more sources
A Backtracking Algorithmic Toolbox for Solving the Subgraph Isomorphism Problem
The subgraph isomorphism problem asks whether a given graph is a subgraph of another graph. It is one of the most general NP-complete problems since many other problems (e.g., Hamiltonian cycle, clique, independent set, etc.) have a natural reduction to subgraph isomorphism.
Jurij Mihelič+2 more
semanticscholar +3 more sources
A hybrid incremental genetic algorithm for subgraph isomorphism problem [PDF]
Finding an isomorphic subgraph is a key problem in many real world applications modeled on graph. In this paper, we propose a new hybrid genetic algorithm(GA) for subgraph isomorphism problem which uses an incremental approach. We solve the problem with increasing the size of the subproblem step by step.
Hyukgeun Choi+2 more
semanticscholar +3 more sources