Approximate subgraph matching-based literature mining for biomedical events and relations.
The biomedical text mining community has focused on developing techniques to automatically extract important relations between biological components and semantic events involving genes or proteins from literature. In this paper, we propose a novel approach for mining relations and events in the biom...
Guardado en:
Autores principales: | Haibin Liu, Lawrence Hunter, Vlado Kešelj, Karin Verspoor |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Public Library of Science (PLoS)
2013
|
Materias: | |
Acceso en línea: | https://doaj.org/article/995f7980536a4081ba98d97a1934f428 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
The Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS): exploiting symmetry for faster subgraph enumeration.
por: Maarten Houbraken, et al.
Publicado: (2014) -
The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees.
por: Sofie Demeyer, et al.
Publicado: (2013) -
Local clustering via approximate heat kernel PageRank with subgraph sampling
por: Zhenqi Lu, et al.
Publicado: (2021) -
A novel rule generator for intrusion detection based on frequent subgraph mining
por: Herrera-Semenets,Vitali, et al.
Publicado: (2017) -
MSGCN: Multi-Subgraph Based Heterogeneous Graph Convolution Network Embedding
por: Junhui Chen, et al.
Publicado: (2021)