Tumor is an abnormal growth of cells that serves no purpose. Carcinoma is a tumor that grows from the top of the cell membrane. In the field of molecular biology, the development of microarray technology is used in data store of disease genetic expression. For each of microarray gene, an amount of information is stored for each trait or condition. In gene expression data clustering can be done with a bicluster algorithm, that’s clustering method not only the objects to be clustered, but also the properties or condition of the object. This research proposed a two-phase method for finding a bicluster. In the first phase, a parallel k-means algorithm is applied to the gene expression data. Then, in the second phase, Cheng and Church biclustering algorithm as one of biclustering method is performed to find biclusters. In this study, we discuss the implementation of two-phase method using biclustering of Cheng and Church and parallel k-means algorithm in Carcinoma tumor gene expression data. From the experimental results, we found five biclusters are formed by Carcinoma gene expression data.

A Tumor is an abnormal growth of cells that serves no purpose. Carcinoma is a tumor that grows from the top of the cell membrane and the organ adenoma is a benign tumor of the gland-like cells or epithelial tissue. In the field of molecular biology, the development of microarray technology is used in the data store of disease genetic expression. For each of microarray gene, an amount of information is stored for each trait or condition. In gene expression data clustering can be done with a bicluster algorithm, thats clustering method which not only the objects to be clustered, but also the properties or condition of the object. This research proposed Plaid Model Biclustering as one of biclustering method. In this study, we discuss the implementation of Plaid Model Biclustering Method on microarray of Carcinoma and Adenoma tumor gene expression data. From the experimental results, we found three biclusters are formed by Carcinoma gene expression data and four biclusters are formed by Adenoma gene expression data.

The emergence of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) in late 2019 resulted in the COVID-19 pandemic, necessitating rapid and accurate detection of pathogens through protein sequence data. This study is aimed at developing an efficient classification model for coronavirus protein sequences using machine learning algorithms and feature selection techniques to aid in the early detection and prediction of novel viruses. We utilized a dataset comprising 2000 protein sequences, including 1000 SARS-CoV-2 sequences and 1000 non-SARS-CoV-2 sequences. Feature extraction provided 27 essential features representing the primary structural data, achieved through the Discere package. To optimize performance, we employed machine learning classification algorithms such as K-nearest neighbor (KNN), XGBoost, and Naïve Bayes, along with feature selection techniques like genetic algorithm (GA), LASSO, and support vector machine recursive feature elimination (SVM-RFE). The SVM-RFE+KNN model exhibited exceptional performance, achieving a classification accuracy of 99.30%, specificity of 99.52%, and sensitivity of 99.55%. These results demonstrate the model’s efficacy in accurately classifying coronavirus protein sequences. Our research successfully developed a robust classification model capable of early detection and prediction of protein sequences in SARS-CoV-2 and other coronaviruses. This advancement holds great promise in facilitating the development of targeted treatments and preventive strategies for combating future viral outbreaks.

Coronaviruses, including severe acute respiratory syndrome coronavirus 2 (SARS‐CoV‐2), continue to pose a significant public health challenge globally, even in 2024. Despite advancements in vaccines and treatments, the accurate classification of coronavirus protein sequences remains crucial for monitoring variants, understanding viral behavior, and developing targeted interventions. In this study, we investigate the efficacy of various classification methods in accurately classifying coronavirus protein sequences. We explore the use of K‐nearest neighbor (KNN), fuzzy KNN (FKNN), support vector machine (SVM), and SVM with particle swarm optimization (PSO‐SVM) algorithms for classification, complemented by feature selection techniques including principal component analysis (PCA) and random forest‐recursive feature elimination (RF‐RFE). Our dataset comprises 2000 protein sequences, evenly split between SARS‐CoV‐2 and non‐SARS‐CoV‐2 sequences. Through rigorous analysis, we evaluate the performance of each classification model in terms of accuracy, sensitivity, specificity, and receiver operating characteristic area under the curve (ROC‐AUC). Our findings demonstrate consistently high performance across all models, reflecting their efficacy in classifying coronavirus protein sequences. Notably, the PCA + PSO‐SVM model emerges as the top‐performing model, exhibiting the highest classification accuracy, specificity, and ROC‐AUC score, demonstrating its effectiveness in distinguishing between SARS‐CoV‐2 and non‐SARS‐CoV‐2 sequences. Overall, our study highlights the importance of employing advanced classification methods and feature selection techniques in accurately classifying coronavirus protein sequences. The findings provide valuable insights for researchers and practitioners in the field of bioinformatics and contribute to ongoing efforts in understanding and combating the COVID‐19 pandemic and its evolving challenges.

Protein sequence data analysis is a fundamental task in bioinformatics, supporting the exploration of biological variations and the identification of functional relationships among proteins. This study presents a performance analysis of four clustering algorithms, which include Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH), Density-Based Spatial Clustering of Applications with Noise (DBSCAN), Agglomerative Hierarchical Clustering, and Spectral Clustering, applied to protein sequence datasets. Feature extraction was conducted using the Discere package in Python, generating 27 numerical attributes from protein sequences. The optimal number of clusters for BIRCH, Agglomerative, and Spectral Clustering was determined using the Elbow method, while DBSCAN parameters (MinPts, Eps) were tuned using the sorted k-distance plot. Clustering performance was assessed using the Silhouette Score. Among the algorithms, DBSCAN produced the highest silhouette score of 0.8105, whereas BIRCH achieved a strong balance between clustering quality, with a score of 0.7405, and computational efficiency. Agglomerative clustering provided moderate results with a score of 0.6779, while Spectral clustering yielded the lowest score of 0.6310 but demonstrated flexibility in capturing complex structures. These findings provide a benchmark comparison of clustering methods for protein sequence data, offering practical insights into algorithm selection based on data characteristics and performance trade-offs.