{"title":"Phylogenetic networks based on the molecular clock hypothesis","authors":"S. Bereg, Yuanyi Zhang","doi":"10.1109/BIBE.2005.46","DOIUrl":"https://doi.org/10.1109/BIBE.2005.46","url":null,"abstract":"A classical result in phylogenetic trees is that a binary phylogenetic tree adhering to the molecular clock hypothesis exists if and only if the matrix of distances between taxa is ultrametric. The ultrametric condition is very restrictive. In this paper we study phylogenetic networks that can be constructed assuming the molecular clock hypothesis. We characterize distance matrices that admit such networks for 3 and 4 taxa. We design an efficient algorithm for a special class of phylogenetic networks that can detect the existence of a network and constructs it.","PeriodicalId":324074,"journal":{"name":"Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126727617","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"GroupAdaBoost for selecting important genes","authors":"Takashi Takenouchi, M. Ushijima, S. Eguchi","doi":"10.1109/BIBE.2005.35","DOIUrl":"https://doi.org/10.1109/BIBE.2005.35","url":null,"abstract":"This paper proposes GroupAdaBoost as a variant of AdaBoost for statistical pattern recognition. The objective of the proposed algorithm is to solve the p /spl Gt/ n problem arisen in bioinformatics. Typically, p is the number of investigated genes and n is number of individuals in a microarray experiment for observing gene expressions in a problem to extract any speci c pattern of gene expressions related to a disease status. The ordinary method for predicting the genetic causes of diseases is apt to over-learn from any particular training dataset because of facing p /spl Gt/ n problem. We observed that GroupAdaBoost gave a robust performance for cases of the excess number of genes. In several real datasets, which are publicly available from Web-pages, we compared the analysis of results among the proposed method and others, and a small scale of simulation study to confirm the validity of the proposed method.","PeriodicalId":324074,"journal":{"name":"Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114634387","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Prediction of outer membrane proteins by support vector machines using combinations of gapped amino acid pair compositions","authors":"Ssu-Hua Huang, Ru-Sheng Liu, Chien-Yu Chen, Ya-Ting Chao, Shu-Yuan Chen","doi":"10.1109/BIBE.2005.48","DOIUrl":"https://doi.org/10.1109/BIBE.2005.48","url":null,"abstract":"Discriminating outer membrane proteins from proteins with other subcellular localizations and with other folding classes are both important to predict farther their functions and structures. In this paper, we propose a method for discriminating outer membrane proteins from other proteins by support vector machines using combinations of gapped amino acid pair compositions. Using 5-fold cross-validation, the method achieves 95% precision and 92% recall on the dataset of proteins with well-annotated subcellular localizations, consisting of 471 outer membrane proteins and 1,120 other proteins. When applied on another dataset of 377 outer membrane proteins and 674 globular proteins belonging to four typical structural classes, the method reaches 96% precision and recall and correctly excludes 98% of the globular proteins. Our method outperforms the OM classifier of PSORTb v.2.0 and a method based on dipeptide composition.","PeriodicalId":324074,"journal":{"name":"Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114639982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Constructing phylogenetic networks from trees","authors":"S. Bereg, Kathryn Bean","doi":"10.1109/BIBE.2005.19","DOIUrl":"https://doi.org/10.1109/BIBE.2005.19","url":null,"abstract":"We present a new method of constructing a phylogenetic network from a given phylogenetic tree. It is based on a procedure that locally improves the tree. The procedure is quite general and can be applied to phylogenetic networks. By repeating local improvements user can introduce a given number of recombination cycles. A sequence of networks with decreasing distance deviation can be generated. The algorithm is efficient and shows a good performance on an example with plants. This is due to the fact that the update in every step is local and optimal.","PeriodicalId":324074,"journal":{"name":"Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131135195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Suboptimal alignments improve the detection of weak homologs in sequence database searches","authors":"Yuheng Li, Mario Lauria, R. Bundschuh","doi":"10.1109/BIBE.2005.54","DOIUrl":"https://doi.org/10.1109/BIBE.2005.54","url":null,"abstract":"PSI-BLAST remains one of the popular tools for searching remote homologs in sequence databases. We recently demonstrated that hybrid alignment can function as the alignment core for PSI-BLAST without loss of sensitivity. Here, we start to exploit the benefits of hybrid alignment. We show that incorporating information about the suboptimal alignments, otherwise ignored in PSI-BLAST, already improves the sensitivity of our enhanced version of PSI-BLAST. More interestingly, we find a set of sequences on which our tool disagrees with the classification given by SCOP. Careful examination points to a possible misclassification in SCOP. Cross-referencing with two other methods of protein structure classification, CATH and DALI, supports this view, indicating that the enriched information from suboptimal alignments is valuable for detecting more weakly homologous sequences.","PeriodicalId":324074,"journal":{"name":"Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133220647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improved phylogenetic motif detection using parsimony","authors":"Usman Roshan, D. Livesay, David La","doi":"10.1109/BIBE.2005.38","DOIUrl":"https://doi.org/10.1109/BIBE.2005.38","url":null,"abstract":"We have recently demonstrated (La et al, Proteins, 58:2005) that sequence fragments approximating the overall familial phylogeny, called phylogenetic motifs (PMs), represent a promising protein functional site prediction strategy. Previous results across a structurally and functionally diverse dataset indicate that phylogenetic motifs correspond to a wide variety of known functional characteristics. Phylogenetic motifs are detected using a sliding window algorithm that compares neighbor joining trees on the complete alignment to those on the sequence fragments. In this investigation we identify PMs using heuristic maximum parsimony trees. We show that when using parsimony the functional site prediction accuracy of PMs improves substantially, particularly on divergent datasets. We also show that the new PMs found using parsimony are not necessarily conserved in sequence, and, therefore, would not be detected by traditional motif (information content-based) approaches.","PeriodicalId":324074,"journal":{"name":"Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121588764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-class biclustering and classification based on modeling of gene regulatory networks","authors":"I. Tagkopoulos, N. Slavov, S. Kung","doi":"10.1109/BIBE.2005.40","DOIUrl":"https://doi.org/10.1109/BIBE.2005.40","url":null,"abstract":"The attempt to elucidate biological pathways and classify genes has led to the development of numerous clustering approaches to gene expression. All these approaches use a single metric to identify genes with similar expression levels. Until now, the correlation between the expression levels of such genes has been based on phenomenological and heuristic correlation functions, rather than on biological models. In this paper, we derive six distinct correlation functions based on explicit thermodynamic modeling of gene regulatory networks. We then combine these correlation functions with novel biclustering algorithms to identify functionally enriched groups. The statistical significance of the identified groups is demonstrated by precision-recall curves and calculated p-values. Furthermore, comparison with chromatin immunoprecipitation data indicates that the performance of the derived correlation functions depends on the specific regulatory mechanisms. Finally, we introduce the idea of multi-class biclustering and with the help of support vector machines we demonstrate its improved classification performance in a microarray dataset.","PeriodicalId":324074,"journal":{"name":"Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126397918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Tracking human breath in infrared imaging","authors":"Zhen Zhu, Jin Fei, Ioannis T. Pavlidis","doi":"10.1109/BIBE.2005.55","DOIUrl":"https://doi.org/10.1109/BIBE.2005.55","url":null,"abstract":"In this paper, we propose a novel tracker to capture the human breathing signal through an infrared imaging method. Human facial physiology information is used to select salient thermal features on the human face as good features to track. The major component of the tracker is mean shift localization (MSL)-based particle filtering. A special measurement model is designed for particle filtering so that the tracker can handle significant head movement and object occlusion. The breathing signal is achieved based on tracking results. The experiments show that the tracker is robust and stable and the recovered breathing signal is clear enough for breathing functionality computation.","PeriodicalId":324074,"journal":{"name":"Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126995227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Structural data mining on secondary genomic structure","authors":"Winnie W. M. Lam, Keith C. C. Chan","doi":"10.1109/BIBE.2005.53","DOIUrl":"https://doi.org/10.1109/BIBE.2005.53","url":null,"abstract":"There exist many methods for classifying genomic data by aligning, comparing, and analyzing primary nucleotide sequences using such algorithms as decision tree and HMM. These methods are, however, not always effective as motifs are more conserved in structures than in sequences. Instead of performing classification based on primary sequences, we therefore propose to perform the task from structure, exploiting the phenomenon in which molecules form from a sequence of nucleotides, beginning with a primary sequence that can fold back onto itself to form a secondary structure. The algorithm we propose is able to perform data mining in structural data and is called random multi-level attributed (RMLA) graph algorithm for mining and representing secondary genomic structure from such biomolecule as tRNA. The identification of structural similarity is implemented with information measure concept to characterize the resultant class. Experiments are based on known tRNA structural data. The results show that our approach is able to effectively classify different class of tRNA secondary structure. We also compare our result with other classification algorithms to prove the effectiveness. The result shows our approach can classify structural data in a better way. In fact, RMLA graph is not suitable only for the classification of genomic data, wherever graphs are used to model data, it is useful for discovering patterns in the databases.","PeriodicalId":324074,"journal":{"name":"Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129089564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Diagnostic rules induced by an ensemble method for childhood leukemia","authors":"Jinyan Li, Huiqing Liu, Ling Li","doi":"10.1109/BIBE.2005.21","DOIUrl":"https://doi.org/10.1109/BIBE.2005.21","url":null,"abstract":"We introduce a new ensemble method based on decision tree to discover significant and diversified rules for subtype classification of childhood acute lymphoblastic leukemia, a heterogeneous disease with individual subtypes differing in their response to chemotherapy. Our approach simply uses each of top-ranked features as root node to build up different trees in the ensemble. Since these trees are all generated from original training samples, rules derived by our algorithm are true and reliable. This is a characteristic of our method contrast to state-of-the-art methods such as Bagging, Boosting and Random Forest which may produce false rules. Experimental results on a large gene expression profiling data set of childhood leukemia patients demonstrate that our proposed method is not only superior to other classifiers' performance, but also can identify a small subset of genes for biomarker analysis.","PeriodicalId":324074,"journal":{"name":"Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05)","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123721787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}