Maximum common subgraph isomorphism problem

Results: 3



#Item
1Big 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 4

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 4

Add to Reading List

Source URL: cisrg.shef.ac.uk

Language: English - Date: 2016-07-11 10:00:44
2Dalke and Hastings Journal of Cheminformatics 2013, 5(Suppl 1):O6 http://www.jcheminf.com/content/5/S1/O6 ORAL PRESENTATION  Open Access

Dalke and Hastings Journal of Cheminformatics 2013, 5(Suppl 1):O6 http://www.jcheminf.com/content/5/S1/O6 ORAL PRESENTATION Open Access

Add to Reading List

Source URL: www.jcheminf.com

Language: English
3BinHunt: Automatically Finding Semantic Differences in Binary Programs Debin Gao1 , Michael K. Reiter2 , and Dawn Song3 1  2

BinHunt: Automatically Finding Semantic Differences in Binary Programs Debin Gao1 , Michael K. Reiter2 , and Dawn Song3 1 2

Add to Reading List

Source URL: bitblaze.cs.berkeley.edu

Language: English - Date: 2013-03-28 20:19:28