ScholarLens Back to search
2016•Lecture notes in computer scienceRequires access

Efficiently Finding Paths Between Classes to Build a SPARQL Query for Life-Science Databases

Atsuko Yamaguchi, Kouji Kozaki, Kai Lenz, Hongyan Wu, Yasunori Yamamoto, Norio Kobayashi

Open publisher page 6 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: SPARQL, Named graph, Computer science, RDF, RDF Schema, RDF query language, Linked data, Information retrieval

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Efficiently Finding Paths Between Classes to Build a SPARQL Query for Life-Science Databases — Research Paper | ScholarLens