CCChi-Ming Chen

Chi-Ming Chen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Chi-Ming Chen has a total of 34 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Mapping cancer heterogeneity: a consensus network approach to subtypes and pathways

    by Geng-Ming Hu, Hsin-Wei Chen, Chi-Ming Chen

    We introduce consensus MSClustering, an unsupervised hierarchical network approach that integrates multi-omics data to identify molecular subtypes and conserved pathways across diverse cancers. Using a novel heterogeneity index, we selected 167 key genes with functionally coherent roles validated through Gene Ontology analysis. Applied to 2439 tumors spanning 10 cancer types—and successfully extended to 2675 tumors (12 types) including cases with incomplete molecular data—MSClustering demonstrated: (i) precise classification of major cancer types and breast cancer molecular subtypes; (ii) discovery of novel pan-cancer squamous metaplastic signatures; (iii) exceptional prognostic stratification (log-rank P = 2.3 × 10−46); and (iv) superior performance over existing methods (COCA/SNF) in classification accuracy, cluster robustness, and computational efficiency. The method’s multi-scale architecture uniquely resolves breast cancer heterogeneity across biological resolution levels. Pathway analysis further revealed four key oncogenic programs—proteoglycan signaling, chromosomal stability, VEGF-mediated angiogenesis, and drug metabolism—along with disruptions in immune and digestive system functions. This integrative framework marks a significant advancement in cancer genomics by enabling more refined molecular classification, enhanced prognostic insights, and deeper understanding of disease mechanisms. These results highlight the potential of MSClustering to inform the development of clinically relevant biomarkers and support more personalized strategies in precision oncology.


  • Open Access

    Phylogenetic network of infectious bronchitis virus: exploring the impact of migratory birds on viral clustering, evolution, and recombination

    by Yu-Chen Tai, Geng-Ming Hu, Chi-Ming Chen

    Infectious bronchitis virus (IBV) presents a major threat to global poultry production, necessitating a thorough understanding of its evolutionary relationships for effective control measures. This study presents a novel distance-based Minimum Span Clustering (MSClustering) method to cluster 311 IBV strains, with a comparison of its results to the established IBV classification. Phylogenetic network and recombination analyses were employed to investigate IBV evolutionary relationships and transmission pathways. The phylogenetic network revealed distinct clusters reflecting relationships between IBV strains. Importantly, these network patterns, combined with recombination event analysis, suggest an unrecognized role for migratory birds in IBV dissemination, highlighting potential transmission pathways beyond established poultry trade routes. These findings contribute to advancing our understanding of IBV evolution and support the development of targeted strategies for controlling viral outbreaks in poultry populations. While statistical limitations may affect threshold estimation for smaller networks, our MSClustering method significantly accelerates processing speeds-approximately 100,000 times faster than PhyML when analyzing the dataset-enabling comprehensive-scale phylogenetic analysis of viruses.


  • Open Access

    Solving puzzles using knowledge-based automation: biomimicry of human solvers

    by Syifa Fauzia, Sean Chen, Ren-Jung Hsu, Rex Chen, Chi-Ming Chen

    The human brain’s remarkable efficiency in solving puzzles through pictorial information processing serves as a valuable inspiration for computational puzzle solving. In this study, we present a nucleation algorithm for automated puzzle solving, developed based on statistical analysis of an empirical database. This algorithm effectively solves puzzles by choosing pieces with infrequent and iridescent edges as nucleation centers, followed by the identification of neighboring pieces with high resemblances from the remaining puzzle pieces. For the 8 different pictures examined in this study, both empirical data and computer simulations consistently demonstrate a power-law relationship between solving time and the number of puzzle pieces, with an exponent less than 2. We explain this relationship through the nucleation model and explore how the exponent is influenced by the color pattern of the puzzle picture. Moreover, our investigation of puzzle-solving processes reveals distinct principal pathways, akin to protein folding behavior. Our study contributes to the development of a cognitive model for human puzzle solving and color pattern recognition.

  • Unraveling the evolutionary patterns and phylogenomics of coronaviruses: A consensus network approach

    by Geng‐Ming Hu, Yu‐Chen Tai, Chi‐Ming Chen

    The COVID‐19 pandemic emphasizes the significance of studying coronaviruses (CoVs). This study investigates the evolutionary patterns of 350 CoVs using four structural proteins (S, E, M, and N) and introduces a consensus methodology to construct a comprehensive phylogenomic network. Our clustering of CoVs into 4 genera is consistent with the current CoV classification. Additionally, we calculate network centrality measures to identify CoV strains with significant average weighted degree and betweenness centrality values, with a specific focus on RaTG13 in the beta genus and NGA/A116E7/2006 in the gamma genus. We compare the phylogenetics of CoVs using our distance‐based approach and the character‐based model with IQ‐TREE. Both methods yield largely consistent outcomes, indicating the reliability of our consensus approach. However, it is worth mentioning that our consensus method achieves an approximate 5000‐fold increase in speed compared to IQ‐TREE when analyzing the data set of 350 CoVs. This improved efficiency enhances the feasibility of conducting large‐scale phylogenomic studies on CoVs.


  • Open Access

    MSClustering: A Cytoscape Tool for Multi-Level Clustering of Biological Networks

    by Bo-Kai Ge, Geng-Ming Hu, Rex Chen, Chi-Ming Chen

    MSClustering is an efficient software package for visualizing and analyzing complex networks in Cytoscape. Based on the distance matrix of a network that it takes as input, MSClustering automatically displays the minimum span clustering (MSC) of the network at various characteristic levels. To produce a view of the overall network structure, the app then organizes the multi-level results into an MSC tree. Here, we demonstrate the package’s phylogenetic applications in studying the evolutionary relationships of complex systems, including 63 beta coronaviruses and 197 GPCRs. The validity of MSClustering for large systems has been verified by its clustering of 3481 enzymes. Through an experimental comparison, we show that MSClustering outperforms five different state-of-the-art methods in the efficiency and reliability of their clustering.


  • Open Access

    SeQuery: an interactive graph database for visualizing the GPCR superfamily

    by Geng-Ming Hu, M K Secario, Chi-Ming Chen

    The rate at which new protein and gene sequences are being discovered has grown explosively in the omics era, which has increasingly complicated the efficient characterization and analysis of their biological properties. In this study, we propose a web-based graphical database tool, SeQuery, for intuitively visualizing proteome/genome networks by integrating the sequential, structural and functional information of sequences. As a demonstration of our tool’s effectiveness, we constructed a graph database of G protein-coupled receptor (GPCR) sequences by integrating data from the UniProt, GPCRdb and RCSB PDB databases. Our tool attempts to achieve two goals: (i) given the sequence of a query protein, correctly and efficiently identify whether the protein is a GPCR, and, if so, define its sequential and functional roles in the GPCR superfamily; and (ii) present a panoramic view of the GPCR superfamily and its network centralities that allows users to explore the superfamily at various resolutions. Such a bottom-up-to-top-down view can provide the users with a comprehensive understanding of the GPCR superfamily through interactive navigation of the graph database. A test of SeQuery with the GPCR2841 dataset shows that it correctly identifies 99 out of 100 queried protein sequences. The developed tool is readily applicable to other biological networks, and we aim to expand SeQuery by including additional biological databases in the near future.


  • Open Access

    Visualizing the GPCR Network: Classification and Evolution

    by Geng-Ming Hu, Te-Lun Mai, Chi-Ming Chen

    In this study, we delineate an unsupervised clustering algorithm, minimum span clustering (MSC), and apply it to detect G-protein coupled receptor (GPCR) sequences and to study the GPCR network using a base dataset of 2770 GPCR and 652 non-GPCR sequences. High detection accuracy can be achieved with a proper dataset. The clustering results of GPCRs derived from MSC show a strong correlation between their sequences and functions. By comparing our level 1 MSC results with the GPCRdb classification, the consistency is 87.9% for the fourth level of GPCRdb, 89.2% for the third level, 98.4% for the second level, and 100% for the top level (the lowest resolution level of GPCRdb). The MSC results of GPCRs can be well explained by estimating the selective pressure of GPCRs, as exemplified by investigating the largest two subfamilies, peptide receptors (PRs) and olfactory receptors (ORs), in class A GPCRs. PRs are decomposed into three groups due to a positive selective pressure, whilst ORs remain as a single group due to a negative selective pressure. Finally, we construct and compare phylogenetic trees using distance-based and character-based methods, a combination of which could convey more comprehensive information about the evolution of GPCRs.


  • Open Access

    Hesperetin-5,7,3’-O-triacetate suppresses airway hyperresponsiveness in ovalbumin-sensitized and challenged mice without reversing xylazine/ketamine-induced anesthesia in normal mice

    by You-Lan Yang, Chi-Li Chen, Chi-Ming Chen, Wun-Chang Ko

    We recently reported that hesperetin-5,7,3’-O-triacetate (HTA) dually inhibited phosphodiesterase (PDE)3/4 with a therapeutic ratio of 20.8. The application and development of PDE4 inhibitors for treating asthma or COPD are limited by their side effects, such as nausea, vomiting and gastric hypersecretion. PDE4 inhibitors were reported to reverse xylazine/ketamine-induced anesthesia in rats and triggered vomiting in ferrets. Thus the reversing effect of HTA on xylazine/ketamine-induced anesthesia in mice was studied to assess emetic effect of HTA. The aim of this study was to prove the therapeutic effect of HTA without vomiting effect at an effective dose for treating COPD. Ten female BALB/c mice in each group were sensitized by ovalbumin (OVA) on days 0 and 14. On day 21, these mice were emphasized the sensitization by Freund’s complete adjuvant. Mice were challenged by 1% OVA nebulization on days 28, 29, and 30. Airway hyperresponsiveness (AHR) was assessed on day 32 in each group, using the FlexiVent system to determine airway resistance (RL) and lung dynamic compliance (Cdyn) in anesthetized ovalbumin (OVA)-sensitized and challenged mice. Each group was orally administered HTA (10 ~ 100 μmol/kg), roflumilast (1 and 5 mg/kg) or vehicles (controls) 2 h before and 6 and 24 h after OVA provocation. For comparison, sham-treated mice were challenged with saline instead of 1% OVA. The ability to reverse xylazine/ketamine-induced anesthesia by HTA or roflumilast for 3 h was determined in normal mice. We used roflumilast, a selective PDE4 inhibitor and bronchodilator for severe COPD approved by the US Food and Drug Administration, as a reference drug. In the results, HTA (100 μmol/kg, p.o.) or roflumilast (5 mg/kg, p.o.) significantly suppressed all RL values of MCh at 0.78 ~ 25 mg/mL and enhanced Cdyn values of MCh at 3.125 ~ 25 mg/mL compared to OVA-sensitized and -challenged control mice. Orally administered 1, 3 or 10 mg/kg roflumilast, but not 30 or 100 μmol/kg HTA, significantly reversed xylazine/ketamine-induced anesthesia. In contrast to roflumilast, HTA may ameliorate COPD but induce few side effects of nausea, vomiting and gastric hypersecretion at an effective dose for treating COPD, because HTA did not reverse xylazine/ketamine-induced anesthesia in mice.


  • Visualizing and Clustering Protein Similarity Networks: Sequences, Structures, and Functions

    by Te-Lun Mai, Geng-Ming Hu, Chi-Ming Chen

    Research in the recent decade has demonstrated the usefulness of protein network knowledge in furthering the study of molecular evolution of proteins, understanding the robustness of cells to perturbation, and annotating new protein functions. In this study, we aimed to provide a general clustering approach to visualize the sequence–structure–function relationship of protein networks, and investigate possible causes for inconsistency in the protein classifications based on sequences, structures, and functions. Such visualization of protein networks could facilitate our understanding of the overall relationship among proteins and help researchers comprehend various protein databases. As a demonstration, we clustered 1437 enzymes by their sequences and structures using the minimum span clustering (MSC) method. The general structure of this protein network was delineated at two clustering resolutions, and the second level MSC clustering was found to be highly similar to existing enzyme classifications. The clustering of these enzymes based on sequence, structure, and function information is consistent with each other. For proteases, the Jaccard’s similarity coefficient is 0.86 between sequence and function classifications, 0.82 between sequence and structure classifications, and 0.78 between structure and function classifications. From our clustering results, we discussed possible examples of divergent evolution and convergent evolution of enzymes. Our clustering approach provides a panoramic view of the sequence–structure–function network of proteins, helps visualize the relation between related proteins intuitively, and is useful in predicting the structure and function of newly determined protein sequences.