„Maximum common subgraph“

Suchergebnisse

14 Treffer

• Tree comparison: enumeration and application to cheminformatics
  Droschinsky, Andre ; Mutzel, Petra ; Fischer, Johannes 2021 Universitätsbibliothek Dortmund
• Comparing graphs – Algorithms & applications
  Kriege, Nils Morten ; Mutzel, Petra ; Kersting, Kristian 2015 Universitätsbibliothek Dortmund
• Learning to Bound for Maximum Common Subgraph Algorithms
  Kothalawala, Buddhi W. ; Koehler, Henning ; Wang, Qing 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Maximum common subgraph: some upper bound and lower bound results
  Huang, Xiuzhen ; Lai, Jing ; Jennings, Steven F.
• A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications
  Akutsu, Tatsuya ; de la Higuera, Colin ; Tamura, Takeyuki 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem
  Vasilchikov, V. V.
• CytoMCS: A Multiple Maximum Common Subgraph Detection Tool for Cytoscape
  Larsen, Simon J. ; Baumbach, Jan
• Geometric, Feature- and Graph-based Analysis of Protein Structures – Novel Methods and Computational Analysis
  Fober, Thomas 2013 Südwestdeutscher Verlag für Hochschulschriften
• Geometric, feature-based and graph-based approaches for the structural analysis of protein binding sites – novel methods and computational analysis
  Fober, Thomas
• Maximum common subgraph isomorphism algorithms for the matching of chemical structures
  Raymond, John W. ; Willett, Peter
• Acceleration of Binding Site Comparisons by Graph Partitioning
  Krotzky, Timo ; Klebe, Gerhard
• Comparison of Maximum Common Subgraph Isomorphism Algorithms for the Alignment of 2D Chemical Structures
  Duesbury, Edmund ; Holliday, John ; Willett, Peter
• A New QUBO Objective Function for Solving the Maximum Common Subgraph Isomorphism Problem Via Quantum Annealing
  Huang, Nan ; Roje, Dominik
• Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks
  Nirmala, Parisutham ; Lekshmi, Ramasubramony Sulochana ; Nadarajan, Rethnasamy