Is Search Of Protein–Ligand Docking A Labeled Graph Matching Problem?
Given two graphs with labeled nodes, labeled graph matching problem is finding an optimal one-to-one mapping between the two graphs.
The performance of the mapping is the summation of correctly aligned connection.
i.e. Two ends of the connection have the same labels in both graphs.
I am not sure if it models the protein ligand docking problem
0 answers
No answers yet.
Log in to answer this question.
More posts like this
-
Visualize paired end reads
written by Chirag Nepal
-
Fast generation of random scale-free networks with a defined power law using R
written by kobipe3 •
-
Interpreting Trinity components
written by Damian Kao
-
Creating subgraph using igraph
written by Vinay •
-
Weighted Graph Matching In Bioinformatics
written by rein07 •
-
Docking With Two Substrates
written by Elmo •
-
Existing Tools For Generating Web Based Network Visualisation
written by Djie •
-
Affinity Data For Inverse Docking Tests
written by Flow
-
Seeking Random Graph Models Of Evolving Food Webs
written by Douglas S. Stones •
-
Efficient Network Motif Finder
written by Simon Cockell
