Kiyoko F. Aoki-Kinoshita
According to our database1, Kiyoko F. Aoki-Kinoshita authored at least 38 papers between 2000 and 2017.
Legend:Book In proceedings Article PhD thesis Other
WURCS 2.0 Update To Encapsulate Ambiguous Carbohydrate Structures.
Journal of Chemical Information and Modeling, 2017
Development and application of an algorithm to compute weighted multiple glycan alignments.
GlyTouCan 1.0 - The international glycan structure repository.
Nucleic Acids Research, 2016
A systematic framework to derive N-glycan biosynthesis process and the automated construction of glycosylation networks.
BMC Bioinformatics, 2016
The Glycome Analytics Platform: an integrative framework for glycobioinformatics.
On using physico-chemical properties of amino acids in string kernels for protein classification via support vector machines.
J. Systems Science & Complexity, 2015
Implementation of linked data in the life sciences at BioHackathon 2011.
J. Biomedical Semantics, 2015
GlycoRDF: an ontology to standardize glycomics data in RDF.
UniCarbKB: building a knowledge platform for glycoproteomics.
Nucleic Acids Research, 2014
WURCS: The Web3 Unique Representation of Carbohydrate Structures.
Journal of Chemical Information and Modeling, 2014
Toolboxes for a standardised and systematic study of glycans.
BMC Bioinformatics, 2014
BioHackathon series in 2011 and 2012: penetration of ontology and linked data in life science domains.
J. Biomedical Semantics, 2014
Frequent glycan structure mining of influenza virus data revealed a sulfated glycan motif that increased viral infection.
Introducing glycomics data into the Semantic Web.
J. Biomedical Semantics, 2013
Modeling genetic regulatory networks: a delay discrete dynamical model approach.
J. Systems Science & Complexity, 2012
The GlycomeAtlas tool for visualizing and querying glycome data.
Multiple Tree Alignment with Weights Applied to Carbohydrates to Extract Binding Recognition Patterns.
Proceedings of the Pattern Recognition in Bioinformatics, 2012
The 2nd DBCLS BioHackathon: interoperable bioinformatics Web services for integrated applications.
J. Biomedical Semantics, 2011
A weighted q-gram method for glycan structure classification.
BMC Bioinformatics, 2010
The DBCLS BioHackathon: standardization and interoperability for bioinformatics web services and workflows.
J. Biomedical Semantics, 2010
A new efficient probabilistic model for mining labeled ordered trees applied to glycobiology.
An Introduction to Bioinformatics for Glycomics Research.
PLoS Computational Biology, 2008
An Efficient Unordered Tree Kernel and Its Application to Glycan Classification.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008
From genomics to chemical genomics: new developments in KEGG.
Nucleic Acids Research, 2006
Improving MHC binding peptide prediction by incorporating binding data of auxiliary MHC molecules.
A new efficient probabilistic model for mining labeled ordered trees.
Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006
ProfilePSTMM: capturing tree-structure motifs in carbohydrate sugar chains.
Proceedings of the Proceedings 14th International Conference on Intelligent Systems for Molecular Biology 2006, 2006
A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006
A Probabilistic Model for Mining Labeled Ordered Trees: Capturing Patterns in Carbohydrate Sugar Chains.
IEEE Trans. Knowl. Data Eng., 2005
A score matrix to reveal the hidden links in glycans.
Cleaning microarray expression data using Markov random fields based on profile similarity.
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005
Managing and Analyzing Carbohydrate Data.
SIGMOD Record, 2004
KCaM (KEGG Carbohydrate Matcher): a software tool for analyzing the structures of carbohydrate sugar chains.
Nucleic Acids Research, 2004
Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees.
Inf. Process. Lett., 2004
A General Probabilistic Framework for Mining Labeled Ordered Trees.
Proceedings of the Fourth SIAM International Conference on Data Mining, 2004
Application of a new probabilistic model for recognizing complex patterns in glycans.
Proceedings of the Proceedings Twelfth International Conference on Intelligent Systems for Molecular Biology/Third European Conference on Computational Biology 2004, 2004
Towards Web-Based Computing.
Int. J. Comput. Geometry Appl., 2001
A Web-Based Distributed Programming Environment.
Proceedings of the High-Performance Computing and Networking, 8th International Conference, 2000