PubMed Health⌕ Search

Biomedical subjects

Jia-Ming Chang

Publications and source records attributed to Jia-Ming Chang.

11 recordsLinked to original sources

On the state of protein function prediction: a report on the fourth CAFA challenge.

BACKGROUND: The Critical Assessment of Functional Annotation (CAFA) is a community effort held to understand the field of computational protein function prediction. Every three years, since 2010, the organizers initiate an experiment to collect function predictions on a large set of proteins and then evaluate the performance of predicting methods on a subset of proteins that have accumulated experimental annotations between the submission deadline and the evaluation time. CAFA provides an independent and rigorous assessment of the current state of the art, thus leveling the playing field, highlighting successes, revealing bottlenecks, and offering a forum for the exchange of ideas in protein science. Here, we report the results of the fourth CAFA experiment (CAFA4). RESULTS: CAFA4 featured the participation of 148 methods from 70 research groups on a total of 46,205 unique proteins over a 5-year annotation accumulation phase, the longest in any CAFA. In a comparison across CAFA2-CAFA4 methods, the prediction of Gene Ontology (GO) terms has clearly improved across all three GO aspects and traditional evaluation settings. While not achieving the first rank, several CAFA2 and CAFA3 methods featured in the top ten methods in many evaluations, suggesting that earlier methods still hold relevance. The performance is weaker in the newly introduced "partial knowledge" evaluation category (proteins with experimental annotations before submission deadline that gained additional annotations in the same GO aspect during the annotation accumulation phase), highlighting the need for a new class of methods. The rankings of the methods were stable over the years in traditional evaluation settings, but less so in the new partial knowledge evaluation. Overall, the field continues to progress with some influx of new participants. Sustained efforts will be necessary to substantially advance it.

Journal Article↗

RIBRA--an error-tolerant algorithm for the NMR backbone assignment problem.

We develop an iterative relaxation algorithm called RIBRA for NMR protein backbone assignment. RIBRA applies nearest neighbor and weighted maximum independent set algorithms to solve the problem. To deal with noisy NMR spectral data, RIBRA is executed in an iterative fashion based on the quality of spectral peaks. We first produce spin system pairs using the spectral data without missing peaks, then the data group with one missing peak, and finally, the data group with two missing peaks. We test RIBRA on two real NMR datasets, hbSBD and hbLBD, and perfect BMRB data (with 902 proteins) and four synthetic BMRB data which simulate four kinds of errors. The accuracy of RIBRA on hbSBD and hbLBD are 91.4% and 83.6%, respectively. The average accuracy of RIBRA on perfect BMRB datasets is 98.28%, and 98.28%, 95.61%, 98.16%, and 96.28% on four kinds of synthetic datasets, respectively.

Algorithms↗

GANA--a genetic algorithm for NMR backbone resonance assignment.

NMR data from different experiments often contain errors; thus, automated backbone resonance assignment is a very challenging issue. In this paper, we present a method called GANA that uses a genetic algorithm to automatically perform backbone resonance assignment with a high degree of precision and recall. Precision is the number of correctly assigned residues divided by the number of assigned residues, and recall is the number of correctly assigned residues divided by the number of residues with known human curated answers. GANA takes spin systems as input data and uses two data structures, candidate lists and adjacency lists, to assign the spin systems to each amino acid of a target protein. Using GANA, almost all spin systems can be mapped correctly onto a target protein, even if the data are noisy. We use the BioMagResBank (BMRB) dataset (901 proteins) to test the performance of GANA. To evaluate the robustness of GANA, we generate four additional datasets from the BMRB dataset to simulate data errors of false positives, false negatives and linking errors. We also use a combination of these three error types to examine the fault tolerance of our method. The average precision rates of GANA on BMRB and the four simulated test cases are 99.61, 99.55, 99.34, 99.35 and 98.60%, respectively. The average recall rates of GANA on BMRB and the four simulated test cases are 99.26, 99.19, 98.85, 98.87 and 97.78%, respectively. We also test GANA on two real wet-lab datasets, hbSBD and hbLBD. The precision and recall rates of GANA on hbSBD are 95.12 and 92.86%, respectively, and those of hbLBD are 100 and 97.40%, respectively.

Algorithms↗

HYPROSP II--a knowledge-based hybrid method for protein secondary structure prediction based on local prediction confidence.

MOTIVATION: In our previous approach, we proposed a hybrid method for protein secondary structure prediction called HYPROSP, which combined our proposed knowledge-based prediction algorithm PROSP and PSIPRED. The knowledge base constructed for PROSP contains small peptides together with their secondary structural information. The hybrid strategy of HYPROSP uses a global quantitative measure, match rate, to determine whether PROSP or PSIPRED is to be used for the prediction of a target protein. HYPROSP made slight improvement of Q(3) over PSIPRED because PROSP predicted well for proteins with match rate >80%. As the portion of proteins with match rate >80% is quite small and as the performance of PSIPRED also improves, the advantage of HYPROSP is diluted. To overcome this limitation and further improve the hybrid prediction method, we present in this paper a new hybrid strategy HYPROSP II that is based on a new quantitative measure called local match rate. RESULTS: Local match rate indicates the amount of structural information that each amino acid can extract from the knowledge base. With the local match rate, we are able to define a confidence level of the PROSP prediction results for each amino acid. Our new hybrid approach, HYPROSP II, is proposed as follows: for each amino acid in a target protein, we combine the prediction results of PROSP and PSIPRED using a hybrid function defined on their respective confidence levels. Two datasets in nrDSSP and EVA are used to perform a 10-fold cross validation. The average Q(3) of HYPROSP II is 81.8% and 80.7% on nrDSSP and EVA datasets, respectively, which is 2.0% and 1.1% better than that of PSIPRED. For local structures with match rate >80%, the average Q(3) improvement is 4.4% on the nrDSSP dataset. The use of local match rate improves the accuracy better than global match rate. There has been a long history of attempts to improve secondary structure prediction. We believe that HYPROSP II has greatly utilized the power of peptide knowledge base and raised the prediction accuracy to a new high. The method we developed in this paper could have a profound effect on the general use of knowledge base techniques for various predictionalgorithms. AVAILABILITY: The Linux executable file of HYPROSP II, as well as both nrDSSP and EVA datasets can be downloaded from http://bioinformatics.iis.sinica.edu.tw/HYPROSPII/.

Algorithms↗

HYPROSP: a hybrid protein secondary structure prediction algorithm--a knowledge-based approach.

We develop a knowledge-based approach (called PROSP) for protein secondary structure prediction. The knowledge base contains small peptide fragments together with their secondary structural information. A quantitative measure M, called match rate, is defined to measure the amount of structural information that a target protein can extract from the knowledge base. Our experimental results show that proteins with a higher match rate will likely be predicted more accurately based on PROSP. That is, there is roughly a monotone correlation between the prediction accuracy and the amount of structure matching with the knowledge base. To fully utilize the strength of our knowledge base, a hybrid prediction method is proposed as follows: if the match rate of a target protein is at least 80%, we use the extracted information to make the prediction; otherwise, we adopt a popular machine-learning approach. This comprises our hybrid protein structure prediction (HYPROSP) approach. We use the DSSP and EVA data as our datasets and PSIPRED as our underlying machine-learning algorithm. For target proteins with match rate at least 80%, the average Q3 of PROSP is 3.96 and 7.2 better than that of PSIPRED on DSSP and EVA data, respectively.

Algorithms↗

Essential role of c-Jun induction and coactivator p300 in epidermal growth factor-induced gene expression of cyclooxygenase-2 in human epidermoid carcinoma A431 cells.

Cyclooxygenase-2 (COX-2) is an inducible enzyme responsible for high-level prostaglandin production during inflammation and carcinogenesis. In this study, the transcriptional regulation of COX-2 expression induced by epidermal growth factor (EGF) in human epidermoid carcinoma A431 cells was studied. EGF treatment induced the expression of COX-2 mRNA, protein, promoter and enzyme activity in a time-dependent manner. EGF-induced COX-2 promoter activity was inhibited by overexpression of the dominant-negative forms of Ras and ERK2. Induction of COX-2 and c-Jun by EGF was completely suppressed by MEK inhibitor combined with JNK inhibitor. Analysis of the COX-2 promoter binding proteins by gel mobility shift assay and DNA affinity precipitation assay revealed that c-Jun and p300 binding to CRE/E-box site were responsible for the EGF-induced COX-2 gene transcription. Overexpression of p300 significantly enhanced COX-2 promoter activity in cells overexpressed of c-Jun or treated with EGF. EGF- and c-Jun-induced transcription of COX-2 promoter was repressed by cotransfection of E1A in a dose-dependent manner. All together, these results indicated that the EGF-induced expression of COX-2 in A431 cells was mediated through the Ras-ERK/JNK signaling pathway, and subsequent induction of c-Jun following MAPK activation, in cooperation with coactivator p300, was required for the EGF response.

Carcinoma, Squamous Cell↗

Computed tomographic assessment of the surgical risks associated with fibrocavernous pulmonary tuberculosis.

PURPOSE: We evaluated the surgical risks associated with fibrocavernous pulmonary tuberculosis by retrospectively examining chest computed tomography (CT) scans. METHODS: We reviewed the records of 40 patients who underwent pulmonary resection for fibrocavernous pulmonary tuberculosis, for whom preoperative CT scans were available. The disease was categorized as class I, defined as a cavity within one lobe without remarkable pleural thickness, in 21 patients; class II, defined as a cavity extending beyond one lobe or within one lobe with remarkable pleural thickness, in 10 patients; and class III, defined as bilateral cavities, in 9 patients. Four of the nine patients with bilateral cavities underwent bilateral pulmonary resection and five underwent unilateral pulmonary resection. The study parameters were intraoperative blood loss, operative time, hospital stay, major operative morbidity, and hospital death. RESULTS: Intraoperative blood loss and operative time were significantly greater and hospital stay was significantly longer in patients with advanced disease (P = 0.046, P = 0.000, and P = 0.143, respectively). Major surgical morbidity mainly occurred in association with advanced disease (P = 0.028) at the following incidences: class I, 5%; class II, 30%; class III, 44.4%. Two hospital deaths occurred, both following bilateral pulmonary resection for class III disease, accounting for an overall 5% mortality rate. CONCLUSION: The surgical risks associated with fibrocavernous pulmonary tuberculosis were well correlated with anatomic involvement, according to the extent of cavitation and the severity of pleural thickness, as depicted by CT. Staged pulmonary resection or the combination of one-sided resection with other modalities is recommended for the treatment of bilateral cavities.

Blood Loss, Surgical↗

Constrained multiple sequence alignment tool development and its application to RNase family alignment.

In this paper, we design a heuristic algorithm of computing a constrained multiple sequence alignment (CMSA for short) for guaranteeing that the generated alignment satisfies the user-specified constraints that some particular residues should be aligned together. If the number of residues needed to be aligned together is a constant alpha, then the time-complexity of our CMSA algorithm for aligning K sequences is O(alphaKn(4)), where n is the maximum of the lengths of sequences. In addition, we have built up such a CMSA software system and made several experiments on the RNase sequences, which mainly function in catalyzing the degradation of RNA molecules. The resulting alignments illustrate the practicability of our method.

Algorithms↗

Flow cytoenzymology of intracellular tartrate-resistant acid phosphatase.

Tartrate-resistant acid phosphatase (TRACP) is a cytochemical marker for hairy cell leukemia, macrophages, dendritic cells, and osteoclasts. Our purpose was to develop multicolor cytofluorometric methods to evaluate intracellular TRACP enzymic activity using a fluorogenic cytochemical reaction in combination with immunochemical stains for distinct surface membrane antigens. Monocyte-derived dendritic cells (DCs) were the model TRACP-expressing cells studied. Intracellular TRACP activity was disclosed using naphthol-ASBI phosphate as substrate with fast red-violet LB salt as coupler for the reaction product. Before the TRACP enzymic reaction, surface antigens, CD86 and CD11c of DCs, were bound with specific fluorescent antibodies to test compatibility of surface labeling and intracellular staining. TRACP activity varied in DCs from donor to donor but was reproducible on repeated examinations of each sample. Samples could be stained for simultaneous analysis of surface antigens and intracellular TRACP activity, provided certain technical details were observed. The TRACP reaction time should not exceed 9 min and the cell number should not exceed 2 x 10(5)/100 micro l test. Fluorescent surface labels did not affect the intensity of the TRACP stain, but the intensity of some surface labels may be diminished by elution of low-affinity antibodies during the TRACP reaction. Readjustment of the threshold settings in triple-labeled cells is needed to compensate for this phenomenon. Intracellular TRACP activity can be quantitated in subpopulations of cells within mixed cell populations by flow cytofluorometry using simple cytochemical methods in combination with fluorescent antibodies to cell-surface and other differentiation antigens. The cytochemical method should be useful for basic investigations of differentiation, maturation, and function of macrophages, DCs, and osteoclasts, and for diagnosis and management of hairy cell leukemia.

Acid Phosphatase↗

Constrained multiple sequence alignment tool development and its application to RNase family alignment.

In this paper, we design an algorithm of computing a constrained multiple sequence alignment (CMSA for short) for guaranteeing that the generated alignment satisfies the user-specified constraints that some particular residues should be aligned together. If the number of residues needed to be aligned together is a constant alpha, then the time-complexity of our CMSA algorithm for aligning K sequences is O (alphaKn4), where n is the maximum of the lengths of sequences. In addition, we have build up such a CMSA software system and made several experiments on the RNase sequences, which mainly function in catalyzing the degradation of RNA molecules. The resulting alignments illustrate the practicability of our method.

Algorithms↗