Structural similarity mining in semi-structured microarray data for efficient storage construction

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

Abstract

Many researches related to storing XML data have been performed and some of them proposed methods to improve the performance of databases by reducing the joins between tables. Those methods are very efficient in deriving and optimizing tables from a DTD or XML schema in which elements and attributes are defined. Nevertheless, those methods are not effective in an XML schema for biological information such as microarray data because even though microarray data have complex hierarchies just a few core values of microarray data repeatedly appear in the hierarchies. In this paper, we propose a new algorithm to extract core features which is repeatedly occurs in an XML schema for biological information, and elucidate how to improve classification speed and efficiency by using a decision tree rather than pattern matching in classifying structural similarities. We designed a database for storing biological information using features extracted by our algorithm. By experimentation, we showed that the proposed classification algorithm also reduced the number of joins between tables. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Jongil, J., Dongil, S., Chulho, C., & Dongkyoo, S. (2006). Structural similarity mining in semi-structured microarray data for efficient storage construction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4277 LNCS-I, pp. 720–729). Springer Verlag. https://doi.org/10.1007/11915034_96

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