MoSS : A Program for Molecular Substructure Mininig

Borgelt, Christian; Meinl, Thorsten; Berthold, Michael R.

MoSS : A Program for Molecular Substructure Mininig

Files

MoSS.pdf(248.9 KB)

Date

2005

Publication type

Contribution to a conference collection

Published in

OSDM '05 : proceedings of the 1st international workshop on open source data mining ; frequent pattern mining implementations / Goethals, Bart et al. (ed.). - New York : ACM Press, 2005. - pp. 6-15. - ISBN 1-59593-210-0

Abstract

Molecular substructure mining is currently an intensively studied research area. In this paper we present an implementation of an algorithm for finding frequent substructures in a set of molecules, which may also be used to find substructures that discriminate well between a focus and a complement group. In addition to the basic algorithm, we discuss advanced pruning techniques, demonstrating their effectiveness with experiments on two publicly available molecular data sets, and briefly mention some other extensions.

Subject (DDC)

004 Computer Science

Cite This

ISO 690

BORGELT, Christian, Thorsten MEINL, Michael R. BERTHOLD, 2005. MoSS : A Program for Molecular Substructure Mininig. In: GOETHALS, Bart, ed. and others. OSDM '05 : proceedings of the 1st international workshop on open source data mining ; frequent pattern mining implementations. New York:ACM Press, pp. 6-15. ISBN 1-59593-210-0

BibTex

@inproceedings{Borgelt2005Progr-5550,
  year={2005},
  title={MoSS : A Program for Molecular Substructure Mininig},
  isbn={1-59593-210-0},
  publisher={ACM Press},
  address={New York},
  booktitle={OSDM '05 : proceedings of the 1st international workshop on open source data mining ; frequent pattern mining implementations},
  pages={6--15},
  editor={Goethals, Bart},
  author={Borgelt, Christian and Meinl, Thorsten 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/5550">
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5550"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Borgelt, Christian</dc:contributor>
    <dc:format>application/pdf</dc:format>
    <dcterms:issued>2005</dcterms:issued>
    <dc:creator>Berthold, Michael R.</dc:creator>
    <dc:creator>Borgelt, Christian</dc:creator>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5550/1/MoSS.pdf"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:21Z</dc:date>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Berthold, Michael R.</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:language>eng</dc:language>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:title>MoSS : A Program for Molecular Substructure Mininig</dcterms:title>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:21Z</dcterms:available>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5550/1/MoSS.pdf"/>
    <dc:contributor>Meinl, Thorsten</dc:contributor>
    <dcterms:abstract xml:lang="eng">Molecular substructure mining is currently an intensively studied research area. In this paper we present an implementation of an algorithm for finding frequent  substructures in a set of molecules, which may also be used to find substructures that discriminate well between a focus and a complement group. In addition to the basic algorithm, we discuss advanced pruning techniques, demonstrating their effectiveness with experiments on two publicly available molecular data sets, and briefly mention some other extensions.</dcterms:abstract>
    <dc:creator>Meinl, Thorsten</dc:creator>
    <dcterms:bibliographicCitation>First publ. in: OSDM 2005: proceedings of the First International Workshop on Open Source Data Mining / Bart Goethals ... New York : ACM Press, 2005, pp. 6-15</dcterms:bibliographicCitation>
  </rdf:Description>
</rdf:RDF>

Bibliography of Konstanz

Yes