2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology最新文献

筛选
英文 中文
Predicting Peroxisomal Proteins 预测过氧化物酶体蛋白
J. Hawkins, M. Bodén
{"title":"Predicting Peroxisomal Proteins","authors":"J. Hawkins, M. Bodén","doi":"10.1109/CIBCB.2005.1594956","DOIUrl":"https://doi.org/10.1109/CIBCB.2005.1594956","url":null,"abstract":"PTS1 proteins are peroxisomal matrix proteins that have a well conserved targeting motif at the C-terminal end. However, this motif is present in many non peroxisomal proteins as well, thus predicting peroxisomal proteins involves differentiating fake PTS1 signals from actual ones. In this paper we report on the development of an SVM classifier with a separately trained logistic output function. The model uses an input window containing 12 consecutive residues at the C-terminus and the amino acid composition of the full sequence. The final model gives a Matthews Correlation Coefficient of 0.77, representing an increase of 54% compared with the well-known PeroxiP predictor. We test the model by applying it to several proteomes of eukaryotes for which there is no evidence of a peroxisome, producing a false positive rate of 0.088%.","PeriodicalId":330810,"journal":{"name":"2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125998712","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}
引用次数: 5
Novel Algorithm for MALDI-TOF Baseline Drift Removal MALDI-TOF基线漂移去除新算法
J. Kolibal, Daniel Howard
{"title":"Novel Algorithm for MALDI-TOF Baseline Drift Removal","authors":"J. Kolibal, Daniel Howard","doi":"10.1109/CIBCB.2005.1594946","DOIUrl":"https://doi.org/10.1109/CIBCB.2005.1594946","url":null,"abstract":"Baseline drift is an endemic problem in matrix-assisted laser desorption ionization time of flight mass spectrometry (MALDI-TOF), a device frequently used in proteomics investigations and in selected genomics work. Following an explanation of the origin of this baseline drift that sheds light on the inherent difficulty of its removal by chemical means, the stochastic Bernstein function approximation (SB), a new signal processing method, is developed into a procedure to obtain a numerically straightforward baseline shift removal. This is successfully applied to proteomics and genmomics MALDI-TOF spectra. Evolutionary computation (EC) can discover (optimize, tune) aspects of the algorithm, for example, the free parameter σ (x) of the SB method. Since baseline drift affects many other types of instrumentation for poorly understood reasons, EC suggests an approach to customize the baseline removal algorithm.","PeriodicalId":330810,"journal":{"name":"2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125282526","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}
引用次数: 4
Pathway Optimization of Biological Drug Response Networks 生物药物反应网络的途径优化
Chien-Feng Huang, C. Forst
{"title":"Pathway Optimization of Biological Drug Response Networks","authors":"Chien-Feng Huang, C. Forst","doi":"10.1109/CIBCB.2005.1594902","DOIUrl":"https://doi.org/10.1109/CIBCB.2005.1594902","url":null,"abstract":"One of the major challenges in systems biology today is to devise generally robust methods of interpreting data concerning the expression levels of the genes in an organism in a way that will shed light on the complex relationships between multiple genes and their products. The ability to better understand and predict the structures and actions of complex biological systems is of significant importance to modern drug discovery as well as our understanding of the mechanisms behind an organism’s ability to react to its environment. In this paper we present a study for robust biological pathway construction through genetic algorithms. The platform is based on the construction of biological networks given different sets of interaction information and the optimization of sub-networks constrained by the gene expression data. As an application, expression data of drug response in M. tuberculosis is used to build generic response subnetworks. Subnetworks are then compared to identify the essential key components that are common to different networks. We are thus able to identify essential nodes in specific drug response. We expect that this approach will provide robust prediction of response networks and accelerate target identification for drug development in the future.","PeriodicalId":330810,"journal":{"name":"2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126341162","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}
引用次数: 2
A Transcriptional Approach to Gene Clustering 基因聚类的转录方法
I. Tagkopoulos
{"title":"A Transcriptional Approach to Gene Clustering","authors":"I. Tagkopoulos","doi":"10.1109/CIBCB.2005.1594921","DOIUrl":"https://doi.org/10.1109/CIBCB.2005.1594921","url":null,"abstract":"We present an integrative method for clustering coregulated genes and elucidating their underlying regulatory mechanisms. We use multi-state partition functions and thermodynamic models to derive six distinct correlation classes that correspond to various Protein-Protein and Protein-DNA interactions. We then introduce a biclustering algorithm for clustering genes based on the correlations exhibited in their expression profiles. We evaluate the functional enrichment and statistical significance of the resulting clusters using precision-recall curves. Our results show that classification performance can be optimized by selecting the corresponding correlation class. Additionally, there is a significant improvement over single class biclustering when we use multi-class support vector machines and biclustering scores as features. Furthermore, the analysis of the upstream regions of all genes comprising each cluster shows that the derived correlation classes capture the expression of genes with shared regulation. We identify over a hundred highly conserved sequences, among which twenty one match well-known regulatory motifs. Further analysis of the identified conserved sequences provides not only an explanation of the classification performance, but serves also as an indicator of the regulatory correlation for various groups.","PeriodicalId":330810,"journal":{"name":"2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132885644","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}
引用次数: 0
Training Reformulated Radial Basis Function Neural Networks Capable of Identifying Uncertainty in the Recognition of Videotaped Neonatal Seizures 训练可识别新生儿癫痫录像识别不确定性的重构径向基函数神经网络
N. Karayiannis, Yaohua Xiong
{"title":"Training Reformulated Radial Basis Function Neural Networks Capable of Identifying Uncertainty in the Recognition of Videotaped Neonatal Seizures","authors":"N. Karayiannis, Yaohua Xiong","doi":"10.1109/CIBCB.2005.1594953","DOIUrl":"https://doi.org/10.1109/CIBCB.2005.1594953","url":null,"abstract":"This paper introduces a learning algorithm that can be used for training reformulated radial basis function neural networks (RBFNNs) capable of identifying uncertainty in data classification. The proposed learning algorithm is used to train a special class of reformulated RBFNNs, known as cosine RBFNNs, to recognize neonatal seizures based on feature vectors obtained by quantifying motion in their video recordings. The experiments verify that cosine RBFNNs trained by the proposed learning algorithm are capable of identifying uncertainty in data classification, a property that is shared by quantum neural networks but not by cosine RBFNNs trained by the original learning algorithm and conventional feed-forward neural networks.","PeriodicalId":330810,"journal":{"name":"2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120959517","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}
引用次数: 4
Gene Classification using Codon Usage and SVMs 基于密码子和支持向量机的基因分类
J. Ma, M. N. Nguyen, G.W.L. Pang, Jagath Rajapakse
{"title":"Gene Classification using Codon Usage and SVMs","authors":"J. Ma, M. N. Nguyen, G.W.L. Pang, Jagath Rajapakse","doi":"10.1109/CIBCB.2005.1594951","DOIUrl":"https://doi.org/10.1109/CIBCB.2005.1594951","url":null,"abstract":"A novel approach for gene classification is proposed, which adopts codon usage bias pattern as feature vector for the subsequent classification using Support Vector Machines (SVMs). A given DNA sequence is first converted to 59-dimensional feature vector, each element corresponding to the relative synonymous usage frequency of a codon. Therefore, the input to the classifier is independent of the size of the DNA sequences. Therefore, our approach is useful when the genes to be classified are of different length, where the homology-based methods are inapplicable due to the difficulty in the alignment of sequences having different lengths. The applicability and usage of the present method is demonstrated by a classification of 1841 HLA (Human Leukocyte Antigen) coding sequences selected from the database of IMGT/HLA. Using the codon usage frequencies, the binary SVM achieved accuracy up to 99.30% for classification human MHC (Major Histocompatibility Complex) molecules in their major classes: MHC-I and MHC-II. By using a multi-class SVM approach, the accuracy rates of 99.73% and 98.38% were achieved for subclasss classification of MHC-I and MHC-II classes, respectively. The results show that the proposed method is capable of accurately classifying MHC molecules in to their major classes as well as in to the subclasses within major classes. Also, the results of gene classification according to the codon usage bias pattern are consistent with the molecule structures and biological functions, further validating our approach.","PeriodicalId":330810,"journal":{"name":"2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126367731","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}
引用次数: 8
Utilizing Domain Knowledge in Neural Network Models for Peptide-Allele Binding Prediction 利用神经网络模型中的领域知识进行多肽-等位基因结合预测
V. Megalooikonomou, D. Kontos, N. DeClaris, P. Cano
{"title":"Utilizing Domain Knowledge in Neural Network Models for Peptide-Allele Binding Prediction","authors":"V. Megalooikonomou, D. Kontos, N. DeClaris, P. Cano","doi":"10.1109/CIBCB.2005.1594941","DOIUrl":"https://doi.org/10.1109/CIBCB.2005.1594941","url":null,"abstract":"We developed Radial Basis Function Neural Networks (RBFNN) for allele-peptide binding prediction. We explored utilizing prior domain knowledge in order to optimize the prediction. We investigated the effect of encoding of inputs of the RBFNN considering chemical properties of amino acids, detecting motifs in alleles and reducing the dimensionality based on common motifs discovered. We also explored a number of parameters such as the data set size, unknown-binding data generation, model architecture and training algorithms. Our approach improved the prediction accuracy of peptide-allele binding reaching up to 90% for our best models.","PeriodicalId":330810,"journal":{"name":"2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130240876","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}
引用次数: 2
Functional Distances for Genes Based on GO Feature Maps and their Application to Clustering 基于GO特征映射的基因功能距离及其聚类应用
N. Speer, H. Fröhlich, C. Spieth, A. Zell
{"title":"Functional Distances for Genes Based on GO Feature Maps and their Application to Clustering","authors":"N. Speer, H. Fröhlich, C. Spieth, A. Zell","doi":"10.1109/CIBCB.2005.1594910","DOIUrl":"https://doi.org/10.1109/CIBCB.2005.1594910","url":null,"abstract":"With the invention of high throughput methods, researchers are capable of producing large amounts of biological data. During the analysis of such data, the need for a functional grouping of genes arises. In this paper, we propose a new functional distance measure for genes and its application to clustering. The proposed distance is based on the concept of empirical feature maps that are built using the Gene Ontology. Besides, our distance function can be calculated much faster than a previous approach. Finally, we show that using this distance function for clustering produces clusters of genes that are of the same quality as in our previous publication. Therefore, it promises to speed up biological data analysis.","PeriodicalId":330810,"journal":{"name":"2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133349865","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}
引用次数: 5
A new distance measure of RNA ensembles and its application to phylogenetic tree construction 一种新的RNA集合距离测量方法及其在系统发育树构建中的应用
Sven Siebert, R. Backofen
{"title":"A new distance measure of RNA ensembles and its application to phylogenetic tree construction","authors":"Sven Siebert, R. Backofen","doi":"10.1109/CIBCB.2005.1594911","DOIUrl":"https://doi.org/10.1109/CIBCB.2005.1594911","url":null,"abstract":"A major challenge in RNA structure analysis is to infer common catalytic or regulatory functions based on primary sequences and secondary structures. Some programs have been developed that compare RNAs with such given structures. Nevertheless, the most important problem is that it is hard to determine the adopted structures of RNAs which are a necessary prerequisite to numerous applications; once a structure has been assigned to a sequence (e.g. the minimum free energy structure), it influences the output of the programs and thus affects the scientific result, especially when dealing with a set of multiple RNAs. In this paper, we go one step further and analyze distances between RNA structure ensembles. They reflect structural relationships computed basically on base-pairing probability matrices. We propose a distance measure between two base-pairing probability matrices showing similar or non-similar structural folding behaviour. This includes the detection of shared optimal, suboptimal and local secondary structures. Consequently, our distance measure avoids falling into the trap of fixing specific structures. A pairwise comparison strategy in a set of multiple RNAs leads us to construct a network of structural relationships using the neighbour joining method. Attempts to predict phylogenetic trees are discussed and demonstrated by means of viral RNAs.","PeriodicalId":330810,"journal":{"name":"2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134171959","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}
引用次数: 1
A Machine Learning Approach to Resolving Incongruence in Molecular Phylogenies and Visualization Analysis 解决分子系统发育不一致的机器学习方法及可视化分析
Xiaoxu Han
{"title":"A Machine Learning Approach to Resolving Incongruence in Molecular Phylogenies and Visualization Analysis","authors":"Xiaoxu Han","doi":"10.1109/CIBCB.2005.1594939","DOIUrl":"https://doi.org/10.1109/CIBCB.2005.1594939","url":null,"abstract":"The incongruence between gene trees and species trees is one of the most pervasive challenges in molecular phylogenetics. In this work, a machine learning approach is proposed to overcome this problem. In the machine learning approach, the gene data set is clustered by a self-organizing map (SOM). Then a phylogenetically informative core gene set is created by combining the maximum entropy gene from each cluster to conduct phylogenetic analysis. Using the same data set, this approach performs better than the previous random gene concatenation method. The SOM based information visualization is also employed to compare the species patterns in the phylogenetic tree constructions.","PeriodicalId":330810,"journal":{"name":"2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129974242","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信