Demo Data from EDBT 2026 / reviewers in the wild / expert
Zhen-Su She
dblp:37/3016
· DBLP profile ↗
6ranked-venue papers
0as first author
0since 2021 · last 2009
0000-0001-7001-9995ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 6
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
3 papers |
Bioinformatics and computational biology · 86% Computational science and engineering · 14% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › genome annotation
translation initiation site prediction |
0.1 | 2 | 2009 | Prediction of translation initiation site for microbial genomes with TriTISA · Bioinform. 2009 Accuracy improvement for identifying translation initiation sites in microbial genomes · Bioinform. 2004 |
Computational science and engineering › graphical models
markov model-based classification |
0.1 | 1 | 2009 | Prediction of translation initiation site for microbial genomes with TriTISA · Bioinform. 2009 |
Bioinformatics and computational biology › sequence analysis
sequence classification |
0.1 | 1 | 2009 | Prediction of translation initiation site for microbial genomes with TriTISA · Bioinform. 2009 |
Bioinformatics and computational biology
molecular evolution |
0.1 | 1 | 2007 | Tree and rate estimation by local evaluation of heterochronous nucleotide data · Bioinform. 2007 |
Bioinformatics and computational biology
phylogenetics |
0.1 | 1 | 2007 | Tree and rate estimation by local evaluation of heterochronous nucleotide data · Bioinform. 2007 |
Bioinformatics and computational biology › phylogenetics
phylogenetic inference |
0.1 | 1 | 2007 | Tree and rate estimation by local evaluation of heterochronous nucleotide data · Bioinform. 2007 |
Bioinformatics and computational biology › genome annotation
gene prediction |
0.0 | 1 | 2004 | Accuracy improvement for identifying translation initiation sites in microbial genomes · Bioinform. 2004 |
Bioinformatics and computational biology
genomics |
0.0 | 1 | 2004 | Accuracy improvement for identifying translation initiation sites in microbial genomes · Bioinform. 2004 |
Bioinformatics and computational biology › genome annotation
prokaryotic genome annotation |
0.0 | 1 | 2004 | Accuracy improvement for identifying translation initiation sites in microbial genomes · Bioinform. 2004 |
Methods — techniques the papers use, named apart from their topics
markov model · 0.1iterative procedure · 0.1bayesian methodology · 0.1variance weighting · 0.1distance matrix methods · 0.1UPGMA · 0.1unsupervised training · 0.0statistical model · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Prediction of translation initiation site for microbial genomes with TriTISAabstractAbstract Summary: We report a new and simple method, TriTISA, for accurate prediction of translation initiation site (TIS) of microbial genomes. TriTISA classifies all candidate TISs into three categories based on evolutionary properties, and characterizes them in terms of Markov models. Then, it employs a Bayesian methodology for the selection of true TIS with a non-supervised, iterative procedure. Assessment on experimentally verified TIS data shows that TriTISA is overall better than all other methods of the state-of-the-art for microbial genome TIS prediction. In particular, TriTISA is shown to have a robust accuracy independent of the quality of initial annotation. Availability: The C++ source code is freely available under the GNU GPL license viahttp://mech.ctb.pku.edu.cn/protisa/TriTISA. Contact: [email protected] Supplementary information: Full documentation of the program, containing installation instructions and other operational details, is available on our website. Supplementary data are available at Bioinformatics online. Gang-Qing Hu, Xiaobin Zheng, Huaiqiu Zhu, Zhen-Su She |
Bioinform. | 4 |
| 2008 | Computational evaluation of TIS annotation for prokaryotic genomesabstractBACKGROUND: Accurate annotation of translation initiation sites (TISs) is essential for understanding the translation initiation mechanism. However, the reliability of TIS annotation in widely used databases such as RefSeq is uncertain due to the lack of experimental benchmarks. RESULTS: Based on a homogeneity assumption that gene translation-related signals are uniformly distributed across a genome, we have established a computational method for a large-scale quantitative assessment of the reliability of TIS annotations for any prokaryotic genome. The method consists of modeling a positional weight matrix (PWM) of aligned sequences around predicted TISs in terms of a linear combination of three elementary PWMs, one for true TIS and the two others for false TISs. The three elementary PWMs are obtained using a reference set with highly reliable TIS predictions. A generalized least square estimator determines the weighting of the true TIS in the observed PWM, from which the accuracy of the prediction is derived. The validity of the method and the extent of the limitation of the assumptions are explicitly addressed by testing on experimentally verified TISs with variable accuracy of the reference sets. The method is applied to estimate the accuracy of TIS annotations that are provided on public databases such as RefSeq and ProTISA and by programs such as EasyGene, GeneMarkS, Glimmer 3 and TiCo. It is shown that RefSeq's TIS prediction is significantly less accurate than two recent predictors, Tico and ProTISA. With convincing proofs, we show two general preferential biases in the RefSeq annotation, i.e. over-annotating the longest open reading frame (LORF) and under-annotating ATG start codon. Finally, we have established a new TIS database, SupTISA, based on the best prediction of all the predictors; SupTISA has achieved an average accuracy of 92% over all 532 complete genomes. CONCLUSION: Large-scale computational evaluation of TIS annotation has been achieved. A new TIS database much better than RefSeq has been constructed, and it provides a valuable resource for further TIS studies. Gang-Qing Hu, Xiaobin Zheng, Lining Ju, Huaiqiu Zhu, Zhen-Su She |
BMC Bioinform. | 5 |
| 2008 | A dynamic Bayesian network approach to protein secondary structure predictionabstractBACKGROUND: Protein secondary structure prediction method based on probabilistic models such as hidden Markov model (HMM) appeals to many because it provides meaningful information relevant to sequence-structure relationship. However, at present, the prediction accuracy of pure HMM-type methods is much lower than that of machine learning-based methods such as neural networks (NN) or support vector machines (SVM). RESULTS: In this paper, we report a new method of probabilistic nature for protein secondary structure prediction, based on dynamic Bayesian networks (DBN). The new method models the PSI-BLAST profile of a protein sequence using a multivariate Gaussian distribution, and simultaneously takes into account the dependency between the profile and secondary structure and the dependency between profiles of neighboring residues. In addition, a segment length distribution is introduced for each secondary structure state. Tests show that the DBN method has made a significant improvement in the accuracy compared to other pure HMM-type methods. Further improvement is achieved by combining the DBN with an NN, a method called DBNN, which shows better Q3 accuracy than many popular methods and is competitive to the current state-of-the-arts. The most interesting feature of DBN/DBNN is that a significant improvement in the prediction accuracy is achieved when combined with other methods by a simple consensus. CONCLUSION: The DBN method using a Gaussian distribution for the PSI-BLAST profile and a high-ordered dependency between profiles of neighboring residues produces significantly better prediction accuracy than other HMM-type probabilistic methods. Owing to their different nature, the DBN and NN combine to form a more accurate method DBNN. Future improvement may be achieved by combining DBNN with a method of SVM type. Xin-Qiu Yao, Huaiqiu Zhu, Zhen-Su She |
BMC Bioinform. | 3 |
| 2007 | Tree and rate estimation by local evaluation of heterochronous nucleotide dataabstractMOTIVATION: Heterochronous gene sequence data is important for characterizing the evolutionary processes of fast-evolving organisms such as RNA viruses. A limited set of algorithms exists for estimating the rate of nucleotide substitution and inferring phylogenetic trees from such data. The authors here present a new method, Tree and Rate Estimation by Local Evaluation (TREBLE) that robustly calculates the rate of nucleotide substitution and phylogeny with several orders of magnitude improvement in computational time. METHODS: For the basis of its rate estimation TREBLE novelly utilizes a geometric interpretation of the molecular clock assumption to deduce a local estimate of the rate of nucleotide substitution for triplets of dated sequences. Averaging the triplet estimates via a variance weighting yields a global estimate of the rate. From this value, an iterative refinement procedure relying on statistical properties of the triplets then generates a final estimate of the global rate of nucleotide substitution. The estimated global rate is then utilized to find the tree from the pairwise distance matrix via an UPGMA-like algorithm. RESULTS: Simulation studies show that TREBLE estimates the rate of nucleotide substitution with point estimates comparable with the best of available methods. Confidence intervals are comparable with that of BEAST. TREBLE's phylogenetic reconstruction is significantly improved over the other distance matrix method but not as accurate as the Bayesian algorithm. Compared with three other algorithms, TREBLE reduces computational time by a minimum factor of 3000. Relative to the algorithm with the most accurate estimates for the rate of nucleotide substitution (i.e. BEAST), TREBLE is over 10,000 times more computationally efficient. AVAILABILITY: jdobrien.bol.ucla.edu/TREBLE.html John D. O'Brien, Xiaobin Zheng, Huaiqiu Zhu, Zhen-Su She |
Bioinform. | 5 |
| 2007 | MED: a new non-supervised gene prediction algorithm for bacterial and archaeal genomesabstractBACKGROUND: Despite a remarkable success in the computational prediction of genes in Bacteria and Archaea, a lack of comprehensive understanding of prokaryotic gene structures prevents from further elucidation of differences among genomes. It continues to be interesting to develop new ab initio algorithms which not only accurately predict genes, but also facilitate comparative studies of prokaryotic genomes. RESULTS: This paper describes a new prokaryotic genefinding algorithm based on a comprehensive statistical model of protein coding Open Reading Frames (ORFs) and Translation Initiation Sites (TISs). The former is based on a linguistic "Entropy Density Profile" (EDP) model of coding DNA sequence and the latter comprises several relevant features related to the translation initiation. They are combined to form a so-called Multivariate Entropy Distance (MED) algorithm, MED 2.0, that incorporates several strategies in the iterative program. The iterations enable us to develop a non-supervised learning process and to obtain a set of genome-specific parameters for the gene structure, before making the prediction of genes. CONCLUSION: Results of extensive tests show that MED 2.0 achieves a competitive high performance in the gene prediction for both 5' and 3' end matches, compared to the current best prokaryotic gene finders. The advantage of the MED 2.0 is particularly evident for GC-rich genomes and archaeal genomes. Furthermore, the genome-specific parameters given by MED 2.0 match with the current understanding of prokaryotic genomes and may serve as tools for comparative genomic studies. In particular, MED 2.0 is shown to reveal divergent translation initiation mechanisms in archaeal genomes while making a more accurate prediction of TISs compared to the existing gene finders and the current GenBank annotation. Huaiqiu Zhu, Gang-Qing Hu, Zhen-Su She |
BMC Bioinform. | 5 |
| 2004 | Accuracy improvement for identifying translation initiation sites in microbial genomesabstractMOTIVATION: At present the computational gene identification methods in microbial genomes have a high prediction accuracy of verified translation termination site (3' end), but a much lower accuracy of the translation initiation site (TIS, 5' end). The latter is important to the analysis and the understanding of the putative protein of a gene and the regulatory machinery of the translation. Improving the accuracy of prediction of TIS is one of the remaining open problems. RESULTS: In this paper, we develop a four-component statistical model to describe the TIS of prokaryotic genes. The model incorporates several features with biological meanings, including the correlation between translation termination site and TIS of genes, the sequence content around the start codon; the sequence content of the consensus signal related to ribosomal binding sites (RBSs), and the correlation between TIS and the upstream consensus signal. An entirely non-supervised training system is constructed, which takes as input a set of annotated coding open reading frames (ORFs) by any gene finder, and gives as output a set of organism-specific parameters (without any prior knowledge or empirical constants and formulas). The novel algorithm is tested on a set of reliable datasets of genes from Escherichia coli and Bacillus subtillis. MED-Start may correctly predict 95.4% of the start sites of 195 experimentally confirmed E.coli genes, 96.6% of 58 reliable B.subtillis genes. Moreover, the test results indicate that the algorithm gives higher accuracy for more reliable datasets, and is robust to the variation of gene length. MED-Start may be used as a postprocessor for a gene finder. After processing by our program, the improvement of gene start prediction of gene finder system is remarkable, e.g. the accuracy of TIS predicted by MED 1.0 increases from 61.7 to 91.5% for 854 E.coli verified genes, while that by GLIMMER 2.02 increases from 63.2 to 92.0% for the same dataset. These results show that our algorithm is one of the most accurate methods to identify TIS of prokaryotic genomes. AVAILABILITY: The program MED-Start can be accessed through the website of CTB at Peking University: http://ctb.pku.edu.cn/main/SheGroup/MED_Start.htm. Huaiqiu Zhu, Gang-Qing Hu, Zheng-Qing Ouyang, Zhen-Su She |
Bioinform. | 5 |