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 - John Willett - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2016-07-11 10:00:44 Cheminformatics Computational science Academia Nature Chemical similarity Fingerprint Maximum common subgraph isomorphism problem Algorithm MCS Enhanced Data Rates for GSM Evolution		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 Download Document from Source Website File Size: 924,93 KB Share Document on Facebook

	Computational Social Science for the World Wide Web (CSSW3) Ingmar Weber Claudia Wagner DocID: 1xUCa - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Inducing Domain-Specific Sentiment Lexicons from Unlabeled Corpora Abstract A word’s sentiment depends on the domain in which it is used. Computational social science research thus requires sentiment lexicons that DocID: 1xUpS - View Document
	Multi-source annotation projection of coreference chains: assessing strategies and testing opportunities Yulia Grishina and Manfred Stede Applied Computational Linguistics FSP Cognitive Science University of Potsdam DocID: 1vrep - View Document
	Computational Imaging of Light in Flight Matthias B. Hullin Institute of Computer Science II, University of Bonn, Regina-Pacis-Weg 3, 53113 Bonn, Germany This is an author-prepared version (Sections 3 and 4 revised and e DocID: 1vqBM - View Document