Mining frequent subtrees in glycan data using the rings Glycan Miner Tool

8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter describes the Glycan Miner Tool, which is available as a part of the Resource for INformatics of Glycomes at Soka Web site. It implements the α-closed frequent subtree algorithm to find significant subtrees from within a data set of glycan structures, or carbohydrate sugar chains. The results are returned in order of p-value, which is computed based on the probability of the reproducibility of the returned structures. There is also a user-friendly manual that allows users to apply glycan array data from the Consortium for Functional Glycomics. Thus, glycobiologists can take the glycan structures that bind to a particular glycan-binding protein, for example, to retrieve the glycan subtrees that are deemed to be important for the binding to occur. © 2013 Springer Science+Business Media New York.

Cite

CITATION STYLE

APA

Aoki-Kinoshita, K. F. (2013). Mining frequent subtrees in glycan data using the rings Glycan Miner Tool. Methods in Molecular Biology, 939, 87–95. https://doi.org/10.1007/978-1-62703-107-3_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free