Mining Molecular Fragments : Finding Relevant Substructures of Molecules

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:7adf5d651d576e3f2efd6d27c67bbd80

BORGELT, Christian, Michael R. BERTHOLD, 2002. Mining Molecular Fragments : Finding Relevant Substructures of Molecules. 2002 IEEE International Conference on Data Mining. ICDM 2002. Maebashi City, Japan. In: 2002 IEEE International Conference on Data Mining, 2002. Proceedings.. 2002 IEEE International Conference on Data Mining. ICDM 2002. Maebashi City, Japan. IEEE Comput. Soc, pp. 51-58. ISBN 0-7695-1754-4

@inproceedings{Borgelt2002Minin-5589, title={Mining Molecular Fragments : Finding Relevant Substructures of Molecules}, year={2002}, doi={10.1109/ICDM.2002.1183885}, isbn={0-7695-1754-4}, publisher={IEEE Comput. Soc}, booktitle={2002 IEEE International Conference on Data Mining, 2002. Proceedings.}, pages={51--58}, author={Borgelt, Christian and Berthold, Michael R.} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5589"> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5589"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:37Z</dcterms:available> <dc:creator>Borgelt, Christian</dc:creator> <dc:language>eng</dc:language> <dcterms:abstract xml:lang="eng">We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instead of carrying out a brute-force search, our method generates fragments by embedding them in all appropriate molecules in parallel and prunes the search tree based on a local order of the atoms and bonds, which results in substantially faster search by eliminating the need for frequent, computationally expensive reembeddings and by suppressing redundant search. We prove the usefulness of our algorithm by demonstrating the discovery of activity-related groups of chemical compounds in the well-known National Cancer Institute s HIV-screening dataset.</dcterms:abstract> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:37Z</dc:date> <dcterms:bibliographicCitation>First publ. in: Proceedings: 2002 IEEE International Conference on Data Mining ICDM 2002, 9-12 December 2002, Maebashi City, Japan / Ed.: Vipin Kumar ... pp. 51-58</dcterms:bibliographicCitation> <dc:creator>Berthold, Michael R.</dc:creator> <dc:contributor>Borgelt, Christian</dc:contributor> <dc:rights>deposit-license</dc:rights> <dc:contributor>Berthold, Michael R.</dc:contributor> <dcterms:title>Mining Molecular Fragments : Finding Relevant Substructures of Molecules</dcterms:title> <dc:format>application/pdf</dc:format> <dcterms:issued>2002</dcterms:issued> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Mining_Molecular_Fragments.pdf 184

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto