Publikation: The ParMol package for frequent subgraph mining
Lade...
Dateien
Datum
2006
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
Electronic Communications of the EASST. 2006
Zusammenfassung
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecular fragments in a database of molecules represented as two-dimensional graphs. However; the search process in arbitrary graph structures includes costly graph and subgraph isomorphism tests. In our ParMol package we have implemented four of the most popular frequent subgraph miners using a common infrastructure: MoFa, gSpan, FFSM, and Gaston. Besides the pure reimplementation, we have added additional functionality to some of the algorithms like parallel search, mining directed graphs, and mining in one big graph instead of a graph database. Also a 2D-visualizer for molecules has been integrated.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
graph, subgraph, frequent, mining, ParMol
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
MEINL, Thorsten, Marc WÖRLEIN, Olga URZOVA, Ingrid FISCHER, Michael PHILIPPSEN, 2006. The ParMol package for frequent subgraph mining. In: Electronic Communications of the EASST. 2006BibTex
@inproceedings{Meinl2006ParMo-5416,
year={2006},
title={The ParMol package for frequent subgraph mining},
booktitle={Electronic Communications of the EASST},
author={Meinl, Thorsten and Wörlein, Marc and Urzova, Olga and Fischer, Ingrid and Philippsen, Michael}
}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/5416">
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:format>application/pdf</dc:format>
<dc:contributor>Meinl, Thorsten</dc:contributor>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5416/1/The_ParMol_package_for_frequent_subgraph_mining.pdf"/>
<dc:language>deu</dc:language>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:11Z</dc:date>
<dc:contributor>Fischer, Ingrid</dc:contributor>
<dcterms:title>The ParMol package for frequent subgraph mining</dcterms:title>
<dc:creator>Urzova, Olga</dc:creator>
<dc:creator>Philippsen, Michael</dc:creator>
<dc:creator>Wörlein, Marc</dc:creator>
<dc:contributor>Wörlein, Marc</dc:contributor>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:11Z</dcterms:available>
<dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
<dc:contributor>Urzova, Olga</dc:contributor>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5416/1/The_ParMol_package_for_frequent_subgraph_mining.pdf"/>
<dc:contributor>Philippsen, Michael</dc:contributor>
<dc:creator>Fischer, Ingrid</dc:creator>
<dcterms:bibliographicCitation>First publ. in: Electronic Communications of the EASST 1 (2006)</dcterms:bibliographicCitation>
<dcterms:abstract xml:lang="eng">Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecular fragments in a database of molecules represented as two-dimensional graphs. However; the search process in arbitrary graph structures includes costly graph and subgraph isomorphism tests. In our ParMol package we have implemented four of the most popular frequent subgraph miners using a common infrastructure: MoFa, gSpan, FFSM, and Gaston. Besides the pure reimplementation, we have added additional functionality to some of the algorithms like parallel search, mining directed graphs, and mining in one big graph instead of a graph database. Also a 2D-visualizer for molecules has been integrated.</dcterms:abstract>
<dcterms:issued>2006</dcterms:issued>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5416"/>
<dc:creator>Meinl, Thorsten</dc:creator>
<dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
