A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:27, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics |
scientific article |
Statements
A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (English)
0 references
26 June 2014
0 references
metrics for structured data
0 references
graph mining
0 references
chemoinformatics
0 references
learning structure-activity relationships
0 references
