Target Gene Mining Algorithm Based on gSpan

Lu, Liangfu and Ren, Xiaoxu and Qi, Lianyong and Cui, Chenming and Jiao, Yichen (2019) Target Gene Mining Algorithm Based on gSpan. In: Collaborative Computing: Networking, Applications and Worksharing. 14th EAI International Conference, CollaborateCom 2018, Shanghai, China, December 1-3, 2018, Proceedings.

[thumbnail of 29386.pdf] PDF
29386.pdf

Download (378kB)

Abstract

In recent years, the focus of bioinformatics research has turned to biological data processing and information extraction. New mining algorithm was designed to mine target gene fragment efficiently from a huge amount of gene data and to study specific gene expression in this paper. The extracted gene data was filtered in order to remove redundant gene data. Then the binary tree was constructed according to the Pearson correlation coefficient between gene data and processed by gSpan frequent subgraph mining algorithm. Finally, the results were visually analyzed in grayscale image way which helped us to find out the target gene. Compared with the existing target gene mining algorithms, such as integrated decision feature gene selection algorithm, our approach enjoys the advantages of higher accuracy and processing high-dimensional data. The proposed algorithm has sufficient theoretical basis, not only makes the results more efficient, but also makes the possibility of error results less. Moreover, the dimension of the data is much higher than the dimension of the data set used by the existing algorithm, so the algorithm is more practical.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Date Deposited: 04 Mar 2026 11:42
Last Modified: 20 Nov 2026 11:58
URI: https://eprints.eai.eu/id/eprint/20399

Actions (login required)

View Item
View Item