• TALE

  • Referenced in 8 articles [sw13844]
  • TALE: A Tool for Approximate Large Graph Matching. Large graph datasets are common in many ... encoded in graphs, effective and efficient graph matching tools are critical. Due to the noisy ... graph datasets, approximate, rather than exact, graph matching is required. Furthermore, many modern applications need ... novel technique for approximate matching of large graph queries. We propose a novel indexing method...
  • SAGA

  • Referenced in 6 articles [sw18905]
  • SAGA: a subgraph matching tool for biological graphs. Motivation: With the rapid increase ... incomplete characteristics of these datasets, exact graph matching methods have limited use and approximate graph ... matching methods are required. Unfortunately, existing graph matching methods are too restrictive as they only ... allow exact or near exact graph matching. This paper presents a novel approximate graph matching...
  • AmgX

  • Referenced in 11 articles [sw13440]
  • aggregation scheme exploits parallel graph matching techniques, while the smoothers and preconditioners often rely...
  • PSMATCH2

  • Referenced in 12 articles [sw08726]
  • full Mahalanobis and propensity score matching, common support graphing, and covariate imbalance testing. psmatch2 implements ... full Mahalanobis and propensity score matching, common support graphing, and covariate imbalance testing. This routine...
  • GrGen

  • Referenced in 21 articles [sw00387]
  • abstraction level of graphs, with declarative pattern matching and rewriting, on a visualization of your...
  • BootCMatch

  • Referenced in 7 articles [sw27182]
  • package for bootstrap AMG based on graph weighted matching. This article has two main objectives ... obtained by a maximum weight matching in the adjacency graph of the system matrix. More...
  • GGL

  • Referenced in 4 articles [sw22850]
  • documentation. Central modules (e.g. graph matching, match handling, graph storage) are combined via simple interfaces...
  • GADDI

  • Referenced in 6 articles [sw18895]
  • GADDI: distance index based subgraph matching in biological networks. Currently, a huge amount of biological ... data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks ... interested in finding all the matches of a query graph in a given large graph ... approach (GADDI) to efficiently find matches of the query graph. GADDI is further optimized...
  • GMTE

  • Referenced in 2 articles [sw07046]
  • tool for graph transformation and exact/Inexact graph matching Multi-labelled graphs are a powerful ... transformation consists of two main tasks: graph matching and graph rewriting. At present, few graph ... tool that support inexact graph matching for the purpose of graph transformation. Also, the main ... paper, we present the tool GMTE -- graph matching and transformation engine. GMTE handles directed...
  • NeMa

  • Referenced in 4 articles [sw18899]
  • needs to identify the matches of a given query graph in a (typically large) network ... substantially differ from its matches in the target graph in both structure and node labels ... minimum cost subgraph matching problem. Given a query graph and a target graph, the problem ... identify the (top-k) matches of the query graph with minimum costs in the target...
  • Graph Matching Toolkit

  • Referenced in 2 articles [sw09487]
  • most flexible mechanisms for error-tolerant graph matching. Its key advantage is that edit distance ... standing software tool integrating these suboptimal graph matching algorithms. It is about being made publicly ... powerful and flexible algorithmic framework for graph edit distance computation can easily be adapted ... features and application of the novel graph matching software...
  • Matchbox

  • Referenced in 4 articles [sw28498]
  • Matchbox, a library of graph matching algorithms...
  • VFLib

  • Referenced in 2 articles [sw13351]
  • VFLib graph matching library is a graph matching library which provides several algorithms for graph ... efficient implementation of the VF2 graph matching algorithm, currently among the fastest ones, able...
  • trueskill

  • Referenced in 24 articles [sw12352]
  • factor graph. Used by Xbox to rank gamers and identify appropriate matches. http://research.microsoft.com/en-us/projects/trueskill/default.aspx...
  • RNAshapes

  • Referenced in 7 articles [sw07960]
  • with correct dangling energies, structure graph output, shape matching and a sliding window approach...
  • Readjoiner

  • Referenced in 4 articles [sw37848]
  • growing interest is the assembly string graph, not necessitating a division of the reads into ... algorithms for the computation of suffix-prefix matches among all pairs of reads. Results: Here ... matches. Transitive edges are recognized and eliminated early in the process and the graph ... only. Conclusions: Our suffix-prefix match determination and string graph construction algorithms have been implemented...
  • COWS

  • Referenced in 51 articles [sw06955]
  • calculi, e.g. asynchronous communication, polyadic synchronization, pattern matching, protection, delimited receiving and killing activities, while ... orchestration constructs, e.g. web services, flow graphs, fault and compensation handlers, and for encoding other...
  • MolGAN

  • Referenced in 2 articles [sw36059]
  • that circumvents the need for expensive graph matching procedures or node ordering heuristics of previous ... adversarial networks (GANs) to operate directly on graph-structured data. We combine our approach with...
  • TRACE

  • Referenced in 2 articles [sw06654]
  • load balancing methodologies, graph partitioning and graph matching, to achieve maximum parallel efficiency...
  • VMQL

  • Referenced in 2 articles [sw22851]
  • query execution can be defined as graph matching. VMQL has been applied to several visual...