Publikation:

Mining Molecular Fragments : Finding Relevant Substructures of Molecules

Lade...
Vorschaubild

Dateien

Mining_Molecular_Fragments.pdf
Mining_Molecular_Fragments.pdfGröße: 133.46 KBDownloads: 782

Datum

2002

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

2002 IEEE International Conference on Data Mining, 2002. Proceedings.. IEEE Comput. Soc, 2002, pp. 51-58. ISBN 0-7695-1754-4. Available under: doi: 10.1109/ICDM.2002.1183885

Zusammenfassung

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.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

2002 IEEE International Conference on Data Mining. ICDM 2002, Maebashi City, Japan
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690BORGELT, 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.. IEEE Comput. Soc, 2002, pp. 51-58. ISBN 0-7695-1754-4. Available under: doi: 10.1109/ICDM.2002.1183885
BibTex
@inproceedings{Borgelt2002Minin-5589,
  year={2002},
  doi={10.1109/ICDM.2002.1183885},
  title={Mining Molecular Fragments : Finding Relevant Substructures of Molecules},
  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:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5589">
    <dc:creator>Borgelt, Christian</dc:creator>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <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>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5589"/>
    <dc:creator>Berthold, Michael R.</dc:creator>
    <dcterms:issued>2002</dcterms:issued>
    <dc:format>application/pdf</dc:format>
    <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>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:37Z</dcterms:available>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5589/1/Mining_Molecular_Fragments.pdf"/>
    <dcterms:title>Mining Molecular Fragments : Finding Relevant Substructures of Molecules</dcterms:title>
    <dc:language>eng</dc:language>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Borgelt, Christian</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5589/1/Mining_Molecular_Fragments.pdf"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:37Z</dc:date>
    <dc:contributor>Berthold, Michael R.</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen