Efficient mining for structurally diverse subgraph patterns in large molecular databases

DOI10.1007/s10994-010-5187-6zbMath1237.68158OpenAlexW2019139558MaRDI QIDQ413872

Christoph Helma, Stefan Kramer, Andreas Maunz

Publication date: 8 May 2012

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-010-5187-6

zbMATH Keywords

backbonecorrelated graph miningdynamic upper bound pruningstructural diversity

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Uses Software

• gSpan
• CloseGraph

Cites Work

• Unnamed Item
• On subtrees of trees

This page was built for publication: Efficient mining for structurally diverse subgraph patterns in large molecular databases