Journal
BIOINFORMATICS
Volume 34, Issue 3, Pages 530-532Publisher
OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/btx602
Keywords
-
Categories
Funding
- JSPS KAKENHI [JP16K16115, JP16H02870]
- Horizon 2020 project CDS-QUAMRI [634541]
- Grants-in-Aid for Scientific Research [16H02870, 16K16115] Funding Source: KAKEN
Ask authors/readers for more resources
aSummary: Measuring the similarity of graphs is a fundamental step in the analysis of graph-structured data, which is omnipresent in computational biology. Graph kernels have been proposed as a powerful and efficient approach to this problem of graph comparison. Here we provide graphkernels, the first R and Python graph kernel libraries including baseline kernels such as label histogram based kernels, classic graph kernels such as random walk based kernels, and the state-of-the-art Weisfeiler-Lehman graph kernel. The core of all graph kernels is implemented in Cthornthorn for efficiency. Using the kernel matrices computed by the package, we can easily perform tasks such as classification, regression and clustering on graph-structured samples. Availability and implementation: The R and Python packages including source code are available at https://CRAN.R-project.org/package=graphkernels and https://pypi.python.org/pypi/graphkernels. Contact: mahito@nii.ac.jp or elisabetta.ghisu@bsse.ethz.ch Supplementary information: Supplementary data are available online at Bioinformatics.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available