Maximum common subgraph isomorphism problem
Results: 3
# | Item |
---|---|
1 | Big is Not Best – Maximum Common Substructure-based Similarity Searching Edmund Duesbury, John Holliday and Peter Willett Information School, University of Sheffield, Regent Court, 211 Portobello Street, Sheffield S1 4Add to Reading ListSource URL: cisrg.shef.ac.ukLanguage: English - Date: 2016-07-11 10:00:44 |
2 | Dalke and Hastings Journal of Cheminformatics 2013, 5(Suppl 1):O6 http://www.jcheminf.com/content/5/S1/O6 ORAL PRESENTATION Open AccessAdd to Reading ListSource URL: www.jcheminf.comLanguage: English |
3 | BinHunt: Automatically Finding Semantic Differences in Binary Programs Debin Gao1 , Michael K. Reiter2 , and Dawn Song3 1 2Add to Reading ListSource URL: bitblaze.cs.berkeley.eduLanguage: English - Date: 2013-03-28 20:19:28 |