Dalke Scientific Software: More science. Less time. Products
Diary RSS | All of Andrew's writings | Diary archive  Writings
from the software side of bioinformatics and chemical
informatics, with a heaping of Python thrown in for good
measure. Code to taste. Best served at room temperature.
Varkony Reconsidered #     Early MCS history  [slide 1] Today
I'm going to talk about the maximum common substructure problem.
[slide 2]  [slide 3]  [slide 4]  [slide 5]  [slide 6]  Multiple
structure MCS and Varkony  [slide 7]  [slide 8]  [slide 9]
[slide 10]    [slide 11]        [slide 12]    Some other MCS
approaches   [slide 13]       [slide 14]  Pruning makes
backtracking effective.   [slide 15]    Clique detection  [slide
16]    [slide 17]  [slide 18]    Multiple structure MCS through
pairwise reduction  [slide 19]    [slide 20]  My two MCS
implementations  [slide 21]     [slide 22]   [slide 23]  [slide
24]  [slide 25]    [slide 26]   [slide 27]   [slide 28]
subgraph enumeration  If not, then it's time to star