Cargando…
Learning the Edit Costs of Graph Edit Distance Applied to Ligand-Based Virtual Screening
BACKGROUND: Graph edit distance is a methodology used to solve error-tolerant graph matching. This methodology estimates a distance between two graphs by determining the minimum number of modifications required to transform one graph into the other. These modifications, known as edit operations, hav...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Bentham Science Publishers
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7536799/ https://www.ncbi.nlm.nih.gov/pubmed/32493194 http://dx.doi.org/10.2174/1568026620666200603122000 |