SING: Subgraph search In Non-homogeneous Graphs

BACKGROUND: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image understanding. Since subgraph isomorphism is a computationally hard problem, indexing techniques have been intensively exploite...

Descripción completa

Detalles Bibliográficos
Autores principales: Di Natale, Raffaele, Ferro, Alfredo, Giugno, Rosalba, Mongiovì, Misael, Pulvirenti, Alfredo, Shasha, Dennis
Formato: Texto
Lenguaje:English
Publicado: BioMed Central 2010
Materias:
Methodology article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2850364/
https://www.ncbi.nlm.nih.gov/pubmed/20170516
http://dx.doi.org/10.1186/1471-2105-11-96

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2850364/
https://www.ncbi.nlm.nih.gov/pubmed/20170516
http://dx.doi.org/10.1186/1471-2105-11-96

Ejemplares similares