Name
Affiliation
Papers
ATSUKO YAMAGUCHI
Advanced Research Laboratory, Hitachi, Ltd., Hatoyama, Saitama, Japan
25
Collaborators
Citations 
PageRank 
190
149
16.11
Referers 
Referees 
References 
480
1202
272
Search Limit
1001000
Title
Citations
PageRank
Year
Reconstruction of Hierarchical Structures in a Thesaurus-based Ontology through Curation by Domain Experts.00.342019
Implementing LOD Surfer as a Search System for the Annotation of Multiple Protein Sequence Alignment.00.342018
YummyData: providing high-quality open life science data.20.412018
LOD Surfer API: Web API for LOD Surfing Using Class-Class Relationships in Life Sciences.00.342017
Semantic Graph Analysis for Federated LOD Surfing in Life Sciences.20.412017
Dynamic Join Order Optimization for SPARQL Endpoint Federation.00.342015
Togotable: Cross-Database Annotation System Using The Resource Description Framework (Rdf) Data Model40.562014
Prototype Implementation of SPARQL Builder for Life-science Databases by Intelligent Schema Analysis on RDF datasets.00.342014
BioHackathon series in 2011 and 2012: penetration of ontology and linked data in life science domains.160.932014
Building Linked Open Data towards integration of biomedical scientific literature with DBpedia.40.402013
Building linked open data using approximate string matching methods and domain specific resources00.342011
The 2nd DBCLS BioHackathon: interoperable bioinformatics Web services for integrated applications.80.562011
Allie: a database and a search service of abbreviations and long forms.131.062011
Discriminative Optimization of String Similarity and Its Application to Biomedical Abbreviation Clustering00.342011
Natural Language Query Processing for Life Science Knowledge - Position Paper00.342010
The DBCLS BioHackathon: standardization and interoperability for bioinformatics web services and workflows.110.702010
A Probabilistic Model for Mining Labeled Ordered Trees: Capturing Patterns in Carbohydrate Sugar Chains90.752005
Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees160.882004
Application of a new probabilistic model for recognizing complex patterns in glycans60.572004
Managing and analyzing carbohydrate data40.492004
Kcam (Kegg Carbohydrate Matcher): A Software Tool For Analyzing The Structures Of Carbohydrate Sugar Chains242.852004
Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees50.482003
Mining biologically active patterns in metabolic pathways using microarray expression profiles60.542003
An approximation algorithm for the two-layered graph drawing problem191.471999
An approximation algorithm for the minimum common supertree problem00.341997