Application of Fireworks Algorithm in Bioinformatics

Application of Fireworks Algorithm in Bioinformatics

Yuchen Zhang (School of Computer Science, Shaanxi Normal University, China), Xiujuan Lei (School of Computer Science, Shaanxi Normal University, China) and Ying Tan (Peking University, China)
DOI: 10.4018/978-1-7998-1659-1.ch011


Fireworks Algorithm (FWA) has been applied to many fields in recent years, showing a strong ability to solve optimization problems. In this chapter, FWA is applied to some research hotspots in bioinformatics, such as biclustering of gene expression data, disease-gene prediction, and identification of LncRNA-protein interactions. This chapter briefly introduces some backgrounds of bioinformatics and related issues. Through corresponding bioinformatics' problems to optimization problems, some specific optimization functions are constructed and solved by the Fireworks Algorithm. The simulation results illustrate that the fireworks algorithm shows high performance and potential application value in the field of bioinformatics.
Chapter Preview


Fireworks algorithm (FWA) (Tan & Zhu, 2010) has been applied to many research fields as a relatively new heuristic optimization algorithm proposed by Tan et al. The algorithm searches the optimal solutions of problems in solution space by simulating the explosion process of fireworks. The performance of this algorithm has also been affirmed by many scholars. For example, A power system reconstruction scheme based on FWA is proposed to minimize the power loss and voltage profile enhancement (Mohamed Imran, Kowsalya, & Systems, 2014). Milan Tuba et al. solved multilevel image threshold problem by using FWA (Tuba, Bacanin, & Alihodzic, 2015). In the large-scale non-convex economic load dispatch problem, the FWA with chaotic sequence operator is applied well (Pandey et al., 2018). At the same time, FWA also derived many improved versions, such as Enhanced FWA (Zheng, Janecek, & Tan, 2013) and Adaptive FWA (Li, Zheng, & Tan, 2014). Thus, FWA is a mature optimization algorithm, and its searching process follows Markova random process.

Bioinformatics, as an interdisciplinary subject of computer science, biology and mathematics, is a hot research field in recent years. Bioinformatics is mainly concerned with the collection, processing, storage, distribution, analysis and interpretation of biological information. It combines the tools and techniques of mathematics, computer science and engineering, and biology to reveal the biological secrets contained in a large number of complex biological data. Through computational methods, sequence alignment, protein complexes mining, essential proteins identification, disease-genes prediction and the relationships exploration between proteins and non-coding RNAs can be carried out. And these problems may be converted into appropriate optimization problems, which can be solved by swarm intelligence algorithm. Therefore, this chapter intends to apply FWA to bioinformatics.

With the rapid development of high-parallel and high-throughput sequencing technology, a large number of gene expression levels have been measured at the same time, thus obtaining a large number of microarray gene expression data (Xiang, Yang, Ma, & Ding, 2003). There are a lot of useful information in the unbalanced gene expression data (Eisen, Spellman, Brown, & Botstein, 1998), such as similarity of gene expression, conditional specificity of gene expression (proliferation, differentiation and canceration of cells). Therefore, data mining and machine learning technology are used widely. (Cheng & Church, 2000) Cheng et al. first applied bi-clustering analysis to gene expression data. Yang et al. combined the method of dealing miss values with the definition of biclustering based on the CC algorithm, and proposed the Flexible Overlapped BiClustering (FLOC) algorithm to obtain multiple double clusters (Yang, Wang, Wang, & Yu, 2002). According to the greedy strategy, Angiulli et al. proposed a new biclustering algorithm RWB. This algorithm utilizes the random walk strategy (Angiulli, Cesario, & Pizzuti, 2008). At the same time, heuristic intelligent algorithms have been applied to this NP-hard problem. A biclustering algorithm based on evolutionary computation is proposed (Divina & Aguilar-Ruiz, 2006). In addition, some new evaluation criteria have also been introduced (Divina, Pontes, Giráldez, Aguilar-Ruiz, & medicine, 2012). However, the new swarm intelligence optimization algorithms proposed in recent years have been applied only a few times. Some scholars found that the cuckoo optimization algorithm can solve the problem of biclustering very well (Balamurugan, Natarajan, & Premalatha, 2018). Lu Yin et al. combined cuckoos algorithms with genetic algorithms to mine submatrices (Yin, Qiu, & Gao, 2018). Therefore, based on FWA, this chapter intends to use it to carry out the study of biclustering of gene expression data.

Key Terms in this Chapter

lncRNA-Protein Interactions: Mutual regulatory relationship between lncRNA and protein.

Disease-genes: Genes that are closely related during the development of the disease.

Biclustering: A data mining technique which cluster information into a matrix by assigning the rows and columns of the matrix at the same time.

Fireworks Algorithm: Heuristic intelligent optimization algorithm by simulating fireworks explosion

Graph Clustering: The goal of graph clustering is to find the community structure. The nodes in the same community are closely related to each other, while the nodes in different communities are relatively sparse.

Gene Expression Matrix: The rows of the gene expression matrix represent the expression of genes, and the columns represent different conditions or samples.

Heterogeneous Networks: The nodes in the network have different kinds or properties, and they are connected to each other.

Gene Ontology: Gene ontology is an ontology widely used in the field of bioinformatics. It covers three aspects of biology: cellular components, molecular functions, and biological processes.

Complete Chapter List

Search this Book: