Figure 8
From: Bayesian refinement of protein functional site matching
Decision tree for refining the graph solution by the MCMC method. Boxes with curved corners show processes and their output while boxes with sharp corners are for branching conditions. The procedure starts with graph solution M G . The graph solution's RMSD and number of matches are denoted by RMSD G and L G respectively. MCMC is re-iterated until the MCMC solution: M B is better. The RMSD and number of matches for M B are denoted by RMSD B and L B respectively. M B and M G are compared using 1) RMSDs and the number of matches or 2) P-values for M G and M G , denoted by P G and P B respectively.