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

筛选
英文 中文
The GeneCards/spl trade/ family of databases: GeneCards, GeneLoc, GeneNote and GeneAnnot GeneCards/spl交易/数据库家族:GeneCards, GeneLoc, GeneNote和GeneAnnot
M. Safran, V. Chalifa-Caspi, O. Shmueli, Naomi Rosen, H. Benjamin-Rodrig, R. Ophir, I. Yanai, M. Shmoish, D. Lancet
{"title":"The GeneCards/spl trade/ family of databases: GeneCards, GeneLoc, GeneNote and GeneAnnot","authors":"M. Safran, V. Chalifa-Caspi, O. Shmueli, Naomi Rosen, H. Benjamin-Rodrig, R. Ophir, I. Yanai, M. Shmoish, D. Lancet","doi":"10.1109/CSB.2003.1227357","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227357","url":null,"abstract":"The popular GeneCards/spl trade/ integrated database of human genes, genomic maps, proteins and diseases has recently spawned three related functional genomics efforts. As sequence data rapidly accumulates, the bottleneck in biology shifts from data production to analysis; researchers seek a profound understanding of the role of each gene, and of the way genes function together. GeneLoc integrates human gene collections by comparing genomic coordinates at the exon level, eliminating redundancies, and assigning unique and meaningful location-based identifiers. GeneCards expression tissue vectors are provided by GeneNote, the first effort to present sophisticated expression analyses for a variety of normal human tissues using the full complement of gene representations (Affymetrix arrays HG-U95A-E). The GeneAnnot system aligns probe-sets with the major public repositories of human mRNA sequences, and provides detailed annotation for each probe-set, with links to GeneCards.","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-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130664230","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
Wavelet transforms for the analysis of microarray experiments 小波变换用于微阵列实验分析
T. Tokuyasu, D. Albertson, D. Pinkel, Ajay N. Jain
{"title":"Wavelet transforms for the analysis of microarray experiments","authors":"T. Tokuyasu, D. Albertson, D. Pinkel, Ajay N. Jain","doi":"10.1109/CSB.2003.1227358","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227358","url":null,"abstract":"Array comparative genomic hybridization (cgh) is a microarray technology for measuring the relative copy number of thousands of genomic regions. Visual examination of cgh profiles shows that genomic changes occur on a variety of length scales. Such changes may be characteristic of phenotypic variables such as tumor type and gene mutational status. To aid in identifying such features and exploring their relationship with phenotypic outcomes, we are applying wavelet transforms to the analysis of such profiles. This allows us to decompose a cgh signal into components on different length scales, even when the genome is severely aberrated, providing a convenient basis for exploring their behavior. Wavelet transforms may also be useful in the realm of gene expression. The expression signal given by genes in clustered order can be wavelet transformed, which compresses the signal from many genes into a few components, possibly aiding in the development of new tumor classifiers.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"43 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":"127213041","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 pattern matching algorithm for codon optimization and CpG motif-engineering in DNA expression vectors DNA表达载体中密码子优化和CpG基序工程的模式匹配算法
R. Satya, A. Mukherjee, U. Ranga
{"title":"A pattern matching algorithm for codon optimization and CpG motif-engineering in DNA expression vectors","authors":"R. Satya, A. Mukherjee, U. Ranga","doi":"10.1109/CSB.2003.1227330","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227330","url":null,"abstract":"Codon optimization enhances the efficiency of DNA expression vectors used in DNA vaccination and gene therapy by increasing protein expression. Additionally, certain nucleotide motifs have experimentally been shown to be immuno-stimulatory while certain others immuno-suppressive. In this paper, we present algorithms to locate a given set of immuno-modulatory motifs in the DNA expression vectors corresponding to a given amino acid sequence and maximize or minimize the number and the context of the immuno-modulatory motifs in the DNA expression vectors. The main contribution is to use multiple pattern matching algorithms to synthesize a DNA sequence for a given amino acid sequence and a graph theoretic approach for finding the longest weighted path in a directed graph that will maximize or minimize certain motifs. This is achieved using O(n/sup 2/) time, where n is the length of the amino acid sequence. Based on this, we develop a software tool.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"34 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":"123575770","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}
引用次数: 23
A contradiction-based framework for testing gene regulation hypotheses 基于矛盾的基因调控假设测试框架
S. Racunas, N. Shah, N. Fedoroff
{"title":"A contradiction-based framework for testing gene regulation hypotheses","authors":"S. Racunas, N. Shah, N. Fedoroff","doi":"10.1109/CSB.2003.1227430","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227430","url":null,"abstract":"We have developed a mathematical framework for representing and testing hypotheses about gene, protein, and signaling molecule interactions. It takes a hierarchical, contradiction-based approach, and can make use of multiple data sources to assess hypothesis viability and to generate a viability partial order over the space of hypotheses. We have developed an event-based formal language for the expression of such hypotheses. This language seamlessly integrates regulatory diagrams (graphical inputs) and structured English (text input) to maximize flexibility. We have developed a pre-topological formalism that allows us to make precise statements about hypothesis similarity and the convergence of iterative refinements of a base hypothesis. To this, we add mathematical machinery that allows us to make precise statements about control and regulation.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"142 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":"116557062","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
An SVM-based algorithm for identification of photosynthesis-specific genome features 基于支持向量机的光合作用特异性基因组特征识别算法
Gong-Xin Yu, G. Ostrouchov, A. Geist, N. Samatova
{"title":"An SVM-based algorithm for identification of photosynthesis-specific genome features","authors":"Gong-Xin Yu, G. Ostrouchov, A. Geist, N. Samatova","doi":"10.1109/CSB.2003.1227323","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227323","url":null,"abstract":"This paper presents a novel algorithm for identification and functional characterization of \"key\" genome features responsible for a particular biochemical process of interest. The central idea is that individual genome features are identified as \"key\" features if the discrimination accuracy between two classes of genomes with respect to a given biochemical process is sufficiently affected by the inclusion or exclusion of these features. In this paper, genome features are defined by high-resolution gene functions. The discrimination procedure utilizes the support vector machine classification technique. The application to the oxygenic photosynthetic process resulted in 126 highly confident candidate genome features. While many of these features are well-known components in the oxygenic photosynthetic process, others are completely unknown, even including some hypothetical proteins. It is obvious that our algorithm is capable of discovering features related to a targeted biochemical process.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"12 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":"122365268","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}
引用次数: 41
A computational method for assessing peptide-identification reliability in tandem mass spectrometry analysis with SEQUEST 一种评估串联质谱分析中肽鉴定可靠性的计算方法
J. Razumovskaya, V. Olman, Dong Xu, E. Uberbacher, N. Verberkmoes, Ying Xu
{"title":"A computational method for assessing peptide-identification reliability in tandem mass spectrometry analysis with SEQUEST","authors":"J. Razumovskaya, V. Olman, Dong Xu, E. Uberbacher, N. Verberkmoes, Ying Xu","doi":"10.1109/CSB.2003.1227353","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227353","url":null,"abstract":"High throughput protein identification in mass spectrometry is predominantly achieved by first identifying tryptic peptides using SEQUEST and then by combining the peptide hits for protein identification. Peptide identification is typically carried out by selecting SEQUEST hits above a specified threshold, the value of which is typically chosen empirically in an attempt to separate true identifications from the false ones. These SEQUEST scores are not normalized with respect to the composition, length and other parameters of the peptides. Furthermore, there is no rigorous reliability estimate assigned to the protein identifications derived from these scores. Hence the interpretation of SEQUEST hits generally requires human involvement, making it difficult to scale up the identification process for genome-scale applications. To overcome these limitations, we have developed a method, which combines a neural network and a statistical model, for \"normalizing\" SEQUEST scores, and also for providing a reliability estimate for each SEQUEST hit. This method improves the sensitivity and specificity of peptide identification compared to the standard filtering procedure used in the SEQUEST package, and provides a basis for estimating the reliability of protein identifications.","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":"128751489","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}
引用次数: 56
Integrating bioinformatics advances into disease management systems to improve quality of care 将生物信息学进展整合到疾病管理系统以提高护理质量
Stephen T. C. Wong
{"title":"Integrating bioinformatics advances into disease management systems to improve quality of care","authors":"Stephen T. C. Wong","doi":"10.1109/CSB.2003.1227297","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227297","url":null,"abstract":"Although we have made progress in reducing mortality and morbidity rates in a number of human diseases through early detection and adjuvant therapy, the interventions inferred from conventional disease management and clinical care systems, such as those in cancers and neurological diseases, still lack discrimination and come at considerable emotional, physical, and financial cost. Complex diseases exhibit complex phenotypes, and proper diagnosis at the point-of-care requires that the analysis take into account the patient's history and exposure to environmental factors, as well as genotype and phenotype information.","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":"128805424","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
Development of a massively-parallel, biological circuit simulator 大规模并行生物电路模拟器的研制
R. Schiek, E. May
{"title":"Development of a massively-parallel, biological circuit simulator","authors":"R. Schiek, E. May","doi":"10.1109/CSB.2003.1227426","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227426","url":null,"abstract":"Genetic expression and control pathways can be successfully modeled as electrical circuits. Given the vast quantity of genomic data, very large and complex genetic circuits can be constructed. To tackle such problems, the massively-parallel, electronic circuit simulator, Xyce/sup /spl trade//, is being adapted to address biological problems. Unique to this biocircuit simulator is the ability to simulate not just one or a set of genetic circuits in a cell, but many cells and their internal circuits interacting through a common environment. Currently, electric circuit analogs for common biological and chemical machinery have been created. Using such analogs, one can construct expression, regulation and reaction networks. Individual species can be connected to other networks or cells via nondiffusive or diffusive channels (i.e. regions where species diffusion limits mass transport). Within any cell, a hierarchy of networks may exist operating at different time-scales to represent different aspects of cellular processes. Though under development, this simulator can model interesting biological and chemical systems. Prokaryotic genetic and metabolic regulatory circuits have been constructed and their interactions simulated for Escherichia coli's tryptophan biosynthesis pathway. Additionally, groups of cells each containing an internal reaction network and communicating via a diffusion limited environment can produce periodic concentration waves. Thus, this biological circuit simulator has the potential to explore large, complex systems and environmentally coupled problems.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"406 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":"126682159","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
Spectral decomposition of the Laplacian matrix applied to RNA folding prediction 拉普拉斯矩阵的光谱分解应用于RNA折叠预测
D. Barash
{"title":"Spectral decomposition of the Laplacian matrix applied to RNA folding prediction","authors":"D. Barash","doi":"10.1109/CSB.2003.1227419","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227419","url":null,"abstract":"RNA secondary structure consists of elements such as stems, bulges, loops. The most obvious and important scalar number that can be attached to an RNA structure is its free energy, with a landscape that governs the folding pathway. However, because of the unique geometry of RNA secondary structure, another interesting single-signed scalar number based on geometrical scales exists that can assist in RNA structure computations. This scalar number is the second eigenvalue of the Laplacian matrix corresponding to a tree-graph representation of the RNA secondary structure. Because of the mathematical properties of the Laplacian matrix, the first eigenvalue is always zero, and the second eigenvalue (often denoted as the Fiedler eigenvalue) is a measure of the compactness of the associated tree-graph. The concept of using the Fiedler eigenvalue/eigenvector is borrowed from domain decomposition in parallel computing. Thus, along with the free energy, the Fiedler eigenvalue can be used as a signature in a clever search among a collection of structures by providing a similarity measure between RNA secondary structures. This can also be used for mutation predictions, classification of RNA secondary folds, filtering and clustering. Furthermore, the Fiedler eigenvector may be used to chop large RNAs into smaller fragments by using spectral graph partitioning, based on the geometry of the secondary structure. Each fragment may then be treated differently for the folding prediction of the entire domain.","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":"126990338","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
Using Easel for modeling and simulating the interactions of cells in order to better understand the basics of biological processes and to predict their likely behaviors 使用Easel建模和模拟细胞的相互作用,以便更好地了解生物过程的基础知识,并预测它们可能的行为
V. Stojkovic, G. Steele, William L. Lupton
{"title":"Using Easel for modeling and simulating the interactions of cells in order to better understand the basics of biological processes and to predict their likely behaviors","authors":"V. Stojkovic, G. Steele, William L. Lupton","doi":"10.1109/CSB.2003.1227392","DOIUrl":"https://doi.org/10.1109/CSB.2003.1227392","url":null,"abstract":"Modeling, simulation, visualization, and animation play a significant role in the study of bioinformatics. Research in this area is generally multidisciplinary in nature and collaboratively conducted by researchers with expertise in biology, bioinformatics, computer science, artificial intelligence, mathematics, and statistics. Easel programming language is used for modeling, simulation, visualization, and animation of interactions of cells in order to better understand the basics of biological processes and to predict their likely behaviors. This paper presents a computer science modeling, simulation, visualization, and animation approach to such research. The paper provides a brief overview of the basic ideas in the \"Message Passing\" Easel program to demonstrate the transmission of signals between cells based on their physical proximity.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"290 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":"116326812","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学术文献互助群
群 号:604180095
Book学术官方微信