Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003最新文献

筛选
英文 中文
Gene selection for cancer classification using bootstrapped genetic algorithms and support vector machines 基于自举遗传算法和支持向量机的癌症分类基因选择
Xue-wen Chen
{"title":"Gene selection for cancer classification using bootstrapped genetic algorithms and support vector machines","authors":"Xue-wen Chen","doi":"10.1109/CSB.2003.1227389","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227389","url":null,"abstract":"The gene expression data obtained from microarrays have shown useful in cancer classification. DNA microarray data have extremely high dimensionality compared to the small number of available samples. In this paper, we propose a novel system for selecting a set of genes for cancer classification. This system is based on a linear support vector machine and a genetic algorithm. To overcome the problem of the small size of training samples, bootstrap methods are combined into genetic search. Two databases are considered: the colon cancer database and the leukemia database. Our experimental results show that the proposed method is capable of finding genes that discriminate between normal cells and cancer cells and generalizes well.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134318847","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}
引用次数: 52
A computational approach to reconstructing gene regulatory networks 重构基因调控网络的计算方法
Xutao Deng, H. Ali
{"title":"A computational approach to reconstructing gene regulatory networks","authors":"Xutao Deng, H. Ali","doi":"10.1109/CSB.2003.1227350","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227350","url":null,"abstract":"With the rapid accumulation of gene expression data in publicly accessible databases, computational study of gene regulation has become an obtainable goal Intrinsic to this task will be data mining tools for inferring knowledge from biological data. In this project, we have developed a new data mining technique in which we adapt the connectivity of a recurrent neural network model by indexing regulatory elements and including nonlinear interaction terms. The new technique reduces the number of parameters by O(n), therefore increasing the chance of recovering the underlying regulatory network. In order to fit the model from data, we have developed a genetic fitting algorithm with O(n) time complexity and that adapts the connectivity during the fitting process until a satisfactory fit is obtained. We have implemented this fitting algorithm and applied it to two data sets: rat central nervous system development (CNS) data with 112 genes, and yeast whole genome data with 2467 genes. With multiple runs of the fitting algorithm, we were able to efficiently generate a statistical pattern of the model parameters from the data. Because of its adaptive features, this method will be especially useful for reconstructing coarse-grained gene regulatory network from large scale or genome scale gene expression data sets.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125012563","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}
引用次数: 10
A personalized and automated dbSNP surveillance system 个性化、自动化dbSNP监控系统
Shuo Liu, Steve Lin, Mark Woon, T. Klein, R. Altman
{"title":"A personalized and automated dbSNP surveillance system","authors":"Shuo Liu, Steve Lin, Mark Woon, T. Klein, R. Altman","doi":"10.1109/CSB.2003.1227312","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227312","url":null,"abstract":"The development of high throughput techniques and large-scale studies in the biological sciences has given rise to an explosive growth in both the volume and types of data available to researchers. A surveillance system that monitors data repositories and reports changes helps manage the data overload. We developed a dbSNP surveillance system (URL: http://www.pharmgkb.org/do/serve?id=tools.surveillance.dbsnp) that performs surveillance on the dbSNP database and alerts users to new information. The system is notable because it is personalized and fully automated. Each registered user has a list of genes to follow and receives notification of new entries concerning these genes. The system integrates data from dbSNP, LocusLink, PharmGKB, and Genbank to position SNPs on reference sequences and classify SNPs into categories such as synonymous and nonsynonymous SNPs. The system uses data warehousing, object model-based data integration, object-oriented programming, and a platform-neutral data access mechanism.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129055250","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
Gene selection for multiclass prediction of microarray data 微阵列数据多类别预测的基因选择
Dechang Chen, D. Hua, J. Reifman, Xiuzhen Cheng
{"title":"Gene selection for multiclass prediction of microarray data","authors":"Dechang Chen, D. Hua, J. Reifman, Xiuzhen Cheng","doi":"10.1109/CSB.2003.1227385","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227385","url":null,"abstract":"Gene expression data from microarrays have been successfully applied to class prediction, where the purpose is to classify and predict the diagnostic category of a sample by its gene expression profile. A typical microarray dataset consists of expression levels for a large number of genes on a relatively small number of samples. As a consequence, one basic and important question associated with class prediction is: how do we identify a small subset of informative genes contributing the most to the classification task? Many methods have been proposed but most focus on two-class problems, such as discrimination between normal and disease samples. This paper addresses selecting informative genes for multiclass prediction problems by jointly considering all the classes simultaneously. Our approach is based on the power of the genes in discriminating among the different classes (e.g., tumor types) and the existing correlation between genes. We formulate the expression levels of a given gene by a one-way analysis of variance model with heterogeneity of variances, and determine the discriminatory power of the gene by a test statistic designed to test the equality of the class means. In other words, the discriminatory power of a gene is associated with a Behrens-Fisher problem. Informative genes are chosen such that each selected gene has a high discriminatory power and the correlation between any pair of selected genes is low. Test statistics considered in this paper include the ANOVA F test statistic, the Brown-Forsythe test statistic, the Cochran test statistic, and the Welch test statistic. Their performances are evaluated over several classification methods applied to two publicly available microarray datasets. The results show that Brown-Forsythe test statistic achieves the best performance.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124288880","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}
引用次数: 22
Eulerian path methods for multiple sequence alignment 多序列比对的欧拉路径方法
M. Waterman, Yu Zhang
{"title":"Eulerian path methods for multiple sequence alignment","authors":"M. Waterman, Yu Zhang","doi":"10.1109/CSB.2003.1227296","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227296","url":null,"abstract":"With the rapid increase in the size of genome sequence databases, the multiple sequence alignment problem is increasingly important and often requires the alignment of a large number of sequences. Beginning in 1975, many heuristic algorithms have been created to improve the speed of computation and the quality of alignment. We introduce a novel approach that is fundamentally distinct from all currently available methods. Our motivation comes from the Eulerian method for fragment assembly in DNA sequence determination, that transforms all the DNA sequencing fragments into a de Bruijn graph and then reduces sequence assembly to a Eulerian path problem.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115837462","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
Computational inference of regulatory pathways in microbes 微生物调控途径的计算推理
Z. Su, P. Dam, Xin Chen, V. Olman, Tao Jiang, B. Palenik, Ying Xu
{"title":"Computational inference of regulatory pathways in microbes","authors":"Z. Su, P. Dam, Xin Chen, V. Olman, Tao Jiang, B. Palenik, Ying Xu","doi":"10.1109/CSB.2003.1227429","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227429","url":null,"abstract":"We present a computational protocol for inference of regulatory and signaling pathways in a microbial cell, through mining \"high-throughput\" biological data of various types, literature search, and computer-assisted human inference. This protocol consists of four key components: (a) construction of template pathways for microbial genomes related to the target genome, which have either been thoroughly studied or had a significant amount of relevant experimental data, (b) inference of target pathways for the target genome, by combining the template pathway models and target genome-specific information, (c) assignment of genes of the target genome to each individual functional roles in the pathway model, and (d) validation and refinement of the pathway models using pathway-specific experimental data or other information. To demonstrate the effectiveness of this procedure, we have applied this computational protocol to the construction of the phosphorus assimilation pathways in synechococcus WH8102. In this paper, we present a model of the core component of this pathway and provide our justification in support of the predicted model.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115132680","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}
引用次数: 9
Statistical inference for well-ordered structures in nucleotide sequences 核苷酸序列中有序结构的统计推断
S. Le, Jih-Hsiang Chen, J. Maizel
{"title":"Statistical inference for well-ordered structures in nucleotide sequences","authors":"S. Le, Jih-Hsiang Chen, J. Maizel","doi":"10.1109/CSB.2003.1227318","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227318","url":null,"abstract":"Distinct, local structures are frequently correlated with functional RNA elements involved in post-transcriptional regulation of gene expression. Discovery of microRNAs (miRNAs) suggests that there are a large class of small noncoding RNAs in eukaryotic genomes. These miRNAs have the potential to form distinct fold-back stem-loop structures. The prediction of those well-ordered folding sequences (WFS) in genomic sequences is very helpful for our understanding of RNA-based gene regulation and the determination of local RNA elements with structure-dependent functions. In this study, we describe a novel method for discovering the local WFS in a nucleotide sequence by Monte Carlo simulation and RNA folding. In the approach the quality of a local WFS is assessed by the energy difference (E/sub diff/) between the optimal structure folded in the local segment and its corresponding optimal, restrained structure where all the previous base pairings formed in the optimal structure are prohibited. Distinct WFS can be discovered by scanning successive segments along a sequence for evaluating the difference between Ediff of the natural sequence and those computed from randomly shuffled sequences. Our results indicate that the statistically significant WFS detected in the genomic sequences of Caenorhabditis elegans (C.elegans) F49E12, T07C5, T07D1, T10H9, Y56A3A and Y71G12B are coincident with known fold-back stem-loops found in miRNA precursors. The potential and implications of our method in searching for miRNAs in genomes is discussed.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114593185","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}
引用次数: 11
Aligning ESTs to genome using multilayer unique makers 利用多层独特标记将est与基因组对齐
F. Hsu, J. F. Chen
{"title":"Aligning ESTs to genome using multilayer unique makers","authors":"F. Hsu, J. F. Chen","doi":"10.1109/CSB.2003.1227409","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227409","url":null,"abstract":"As more and more genomic sequences have been sequenced and rapid growing of number of EST (expressed sequence tag), we need very fast and efficient algorithms to align ESTs to genome. ESTs contain the exon/intron structure. Let G and E denote the given genome and the given EST sequence respectively. In order to reduce the time complexity, it is quite important to locate the position of E in G efficiently. A unique maker is a sequence appeared in G only once. We can locate the position of E in G by finding unique markers contained in E. The time complexity to align ESTs to genome grows rapidly when we use longer unique markers. In this paper, we propose a multi-layer unique marker method to align ESTs to genome. Our method has the benefit of both short and long unique markers. Our algorithm can also use to locate the position of single nucleotide polymorphism (SNP). Experimental result shows that our method is much faster than common tools such as SIM4 and BLAT.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117043061","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
Probability profiles-novel approach in tandem mass spectrometry De Novo sequencing 概率剖面-串联质谱新方法De Novo测序
T. Fridman, Robert M. Day, Jane Razumovsbya, Dong Xu, A. Gorin
{"title":"Probability profiles-novel approach in tandem mass spectrometry De Novo sequencing","authors":"T. Fridman, Robert M. Day, Jane Razumovsbya, Dong Xu, A. Gorin","doi":"10.1109/CSB.2003.1227351","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227351","url":null,"abstract":"A novel method is proposed for deciphering experimental tandem mass spectra. A large database of previously resolved peptide spectra was used to determine \"neighborhood patterns\" for each peak category: C- or N-terminus ions, their dehydrated fragments, etc. The established patterns are applied to assign probabilities for new spectra peaks to fit into these categories. A few peaks often could be identified with a fair confidence creating strong \"anchor points\" for De Novo algorithm assembling sequence subgraphs. Our approach is utilizing all informational content of a given MS experimental data set, including peak intensities, weak and noisy peaks, and unusual fragments. We also discuss ways to provide learning features in our method: adjustments for a specific MS device and user initiated changes in the list of considered peak identities.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115718058","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}
引用次数: 3
PTC: an interactive tool for phylogenetic tree construction 系统发育树构建的交互式工具
Chen Yang, S. Khuri
{"title":"PTC: an interactive tool for phylogenetic tree construction","authors":"Chen Yang, S. Khuri","doi":"10.1109/CSB.2003.1227378","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227378","url":null,"abstract":"A phylogenetic tree represents the evolutionary history of a group of organisms. In this work, we introduce a novel interactive tool for constructing phylogenetic trees, phylogenetic tree construction package. The package supports four well-known algorithms, unweighted pair group method using arithmetic average, neighbor joining, Fitch Margoliash, and maximum parsimony.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115812619","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
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书