A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
DOI10.1016/j.amc.2015.02.042zbMath1390.05053OpenAlexW1995774220MaRDI QIDQ1636844
Publication date: 7 June 2018
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.02.042
graphsgraph similarityquantitative graph theorychemical graphsgraph distance measuresgraph similarity measures
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A similarity measure for graphs with low computational complexity
- Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
- Distances and volumina for graphs
- Parallel concepts in graph theory
- Comparing large graphs efficiently by margins of feature vectors
- Multivariate image similarity in the compressed domain using statistical graph matching
- Graph Energy
- On a certain distance between isomorphism classes of graphs
- Inexact graph matching for structural pattern recognition
- Learning Theory and Kernel Machines
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees