A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q115926710, #quickstatements; #temporary_batch_1710970253704 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q115926710 / rank | |||
Normal rank | |||
Revision as of 22:37, 20 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
