about
Semantic Web technologies for the big data in life sciencesThe health care and life sciences community profile for dataset descriptionsAllie: a database and a search service of abbreviations and long formsBioHackathon series in 2011 and 2012: penetration of ontology and linked data in life science domainsBioBenchmark Toyama 2012: an evaluation of the performance of triple stores on biological dataBuilding Linked Open Data towards integration of biomedical scientific literature with DBpediaThe 3rd DBCLS BioHackathon: improving life science data integration with Semantic Web technologiesThe DBCLS BioHackathon: standardization and interoperability for bioinformatics web services and workflows. The DBCLS BioHackathon Consortium*TogoTable: cross-database annotation system using the Resource Description Framework (RDF) data modelThe 2nd DBCLS BioHackathon: interoperable bioinformatics Web services for integrated applicationsDiscriminative application of string similarity methods to chemical and non-chemical names for biomedical abbreviation clustering.KCaM (KEGG Carbohydrate Matcher): a software tool for analyzing the structures of carbohydrate sugar chains.Application of a new probabilistic model for recognizing complex patterns in glycans.Efficient tree-matching methods for accurate carbohydrate database queries.Semantic Graph Analysis for Federated LOD Surfing in Life SciencesEfficiently Finding Paths Between Classes to Build a SPARQL Query for Life-Science DatabasesSemantic Data Acquisition by Traversing Class–Class Relationships Over Linked Open DataBuilding linked open data using approximate string matching methods and domain specific resourcesDiscriminative Application of String Similarity Methods to Chemical and Non-chemical Names for Biomedical Abbreviation ClusteringDiscriminative Optimization of String Similarity and Its Application to Biomedical Abbreviation ClusteringNatural Language Query Processing for Life Science KnowledgeA probabilistic model for mining labeled ordered trees: capturing patterns in carbohydrate sugar chainsFinding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning treesAn Approximation Algorithm for the Two-Layered Graph Drawing ProblemBioHackathon 2015: Semantics of data for life sciences and reproducible researchSplit4Blank: Maintaining consistency while improving efficiency of loading RDF data with blank nodes
P50
Q27021332-94045B3B-753C-4FBF-96B5-3825907A74AFQ27943351-DCED2D23-A8CF-4504-82F1-6A46EBB057E3Q27975906-92FFA247-35F0-4DFA-B73E-FD9D63DBAFF1Q27975958-F6C29B78-054F-4DF3-A80C-7A307F86BA92Q27975969-CF723897-E859-42FF-83D6-E54E87CFD661Q27975972-792CC524-9E8D-43DF-AD96-55F42A0816D9Q27975975-DE8FF8BC-FB1A-4BC0-AA46-EF75A7F7E723Q27975982-3418E4CD-6AF4-49C9-A827-4029EBA97457Q28656008-DB2456BB-74BE-447B-AE3D-0B4949D394FFQ30405503-6A3B0584-C43E-4792-9621-10D361AA274DQ34324890-9A63A785-9062-4C4B-BC0C-502344405210Q41011185-DD860E44-8376-4288-B0B0-317A62EA422EQ48534156-0B532ED4-9D08-443C-8B8D-36496AC4BFD3Q51978087-782500A8-DA4F-483A-8D8E-0671523CBEE8Q57010750-2DBA16A1-5A69-4133-A4CC-66EF493E8758Q57010754-B3934524-EADD-47D6-A3DD-C10641F07FFDQ57010758-D578A102-EE77-4E7D-9810-FF2AA42261D0Q57010768-38CF6E52-3434-4953-B558-581A47EFF9EAQ57010773-E1BA30A8-8D38-45BB-899E-B91828057FB4Q57010778-9764C000-959C-4E56-8C67-D88B29E377EBQ57010781-C46F907A-78DA-43CD-AD12-116FF5BC087CQ57010785-64635398-E3F4-4E3D-B374-3BC62CD7432CQ57010789-8038DD1E-9C00-4CCE-83F9-C6199596A125Q57010795-96F3E55A-C3C1-4EFD-81DE-5BF4429D74A3Q92065187-A90B46B4-7013-4449-B2A0-045D027018DCQ92516063-4E915C39-30ED-4978-8A1C-519163E4BE61
P50
description
hulumtuese
@sq
researcher
@en
wetenschapper
@nl
հետազոտող
@hy
name
Atsuko Yamaguchi
@ast
Atsuko Yamaguchi
@en
Atsuko Yamaguchi
@es
Atsuko Yamaguchi
@nl
Atsuko Yamaguchi
@sl
type
label
Atsuko Yamaguchi
@ast
Atsuko Yamaguchi
@en
Atsuko Yamaguchi
@es
Atsuko Yamaguchi
@nl
Atsuko Yamaguchi
@sl
prefLabel
Atsuko Yamaguchi
@ast
Atsuko Yamaguchi
@en
Atsuko Yamaguchi
@es
Atsuko Yamaguchi
@nl
Atsuko Yamaguchi
@sl
P106
P1153
36109686600
P21
P2456
P31
P496
0000-0001-7538-5337