发布求助
文献互助 智能选刊 最新文献

Proceedings. International Conference on Intelligent Systems for Molecular Biology最新文献

筛选
英文 中文
Linear modeling of genetic networks from experimental data. 基于实验数据的遗传网络线性建模。
Proceedings. International Conference on Intelligent Systems for Molecular Biology Pub Date : 2000-01-01
E P van Someren, L F Wessels, M J Reinders
{"title":"Linear modeling of genetic networks from experimental data.","authors":"E P van Someren,&nbsp;L F Wessels,&nbsp;M J Reinders","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>In this paper, the regulatory interactions between genes are modeled by a linear genetic network that is estimated from gene expression data. The inference of such a genetic network is hampered by the dimensionality problem. This problem is inherent in all gene expression data since the number of genes by far exceeds the number of measured time points. Consequently, there are infinitely many solutions that fit the data set perfectly. In this paper, this problem is tackled by combining genes with similar expression profiles in a single prototypical 'gene'. Instead of modeling the genes individually, the relations between prototypical genes are modeled. In this way, genes that cannot be distinguished based on their expression profiles are grouped together and their common control action is modeled instead. This process reduces the number of signals and imposes a structure on the model that is supported by the fact that biological genetic networks are thought to be redundant and sparsely connected. In essence, the ambiguity in model solutions is represented explicitly by providing a generalized model that expresses the basic regulatory interactions between groups of similarly expressed genes. The modeling approach is illustrated on artificial as well as real data.</p>","PeriodicalId":79420,"journal":{"name":"Proceedings. International Conference on Intelligent Systems for Molecular Biology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"21813095","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
Towards a complete map of the protein space based on a unified sequence and structure analysis of all known proteins. 在对所有已知蛋白质进行统一的序列和结构分析的基础上，迈向蛋白质空间的完整图谱。
Proceedings. International Conference on Intelligent Systems for Molecular Biology Pub Date : 2000-01-01
G Yona, M Levitt
{"title":"Towards a complete map of the protein space based on a unified sequence and structure analysis of all known proteins.","authors":"G Yona,&nbsp;M Levitt","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>In search for global principles that may explain the organization of the space of all possible proteins, we study all known protein sequences and structures. In this paper we present a global map of the protein space based on our analysis. Our protein space contains all protein sequences in a non-redundant (NR) database, which includes all major sequence databases. Using the PSI-BLAST procedure we defined 4,670 clusters of related sequences in this space. Of these clusters, 1,421 are centered on a sequence of known structure. All 4,670 clusters were then compared using either a structure metric (when 3D structures are known) or a novel sequence profile metric. These scores were used to define a unified and consistent metric between all clusters. Two schemes were employed to organize these clusters in a meta-organization. The first uses a graph theory method and cluster the clusters in an hierarchical organization. This organization extends our ability to predict the structure and function of many proteins beyond what is possible with existing tools for sequence analysis. The second uses a variation on a multidimensional scaling technique to embed the clusters in a low dimensional real space. This last approach resulted in a projection of the protein space onto a 2D plane that provides us with a bird's eye view of the protein space. Based on this map we suggest a list of possible target sequences with unknown structure that are likely to adopt new, unknown folds.</p>","PeriodicalId":79420,"journal":{"name":"Proceedings. International Conference on Intelligent Systems for Molecular Biology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"21813099","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
Alignment of flexible protein structures. 柔性蛋白质结构的排列。
Proceedings. International Conference on Intelligent Systems for Molecular Biology Pub Date : 2000-01-01
M Shatsky, Z Y Fligelman, R Nussinov, H J Wolfson
{"title":"Alignment of flexible protein structures.","authors":"M Shatsky,&nbsp;Z Y Fligelman,&nbsp;R Nussinov,&nbsp;H J Wolfson","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>We present two algorithms which align flexible protein structures. Both apply efficient structural pattern detection and graph theoretic techniques. The FlexProt algorithm simultaneously detects the hinge regions and aligns the rigid subparts of the molecules. It does it by efficiently detecting maximal congruent rigid fragments in both molecules and calculating their optimal arrangement which does not violate the protein sequence order. The FlexMol algorithm is sequence order independent, yet requires as input the hypothesized hinge positions. Due its sequence order independence it can also be applied to protein-protein interface matching and drug molecule alignment. It aligns the rigid parts of the molecule using the Geometric Hashing method and calculates optimal connectivity among these parts by graph-theoretic techniques. Both algorithms are highly efficient even compared with rigid structure alignment algorithms. Typical running times on a standard desktop PC (400 MHz) are about 7 seconds for FlexProt and about 1 minute for FlexMol.</p>","PeriodicalId":79420,"journal":{"name":"Proceedings. International Conference on Intelligent Systems for Molecular Biology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"21812564","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
Integrative analysis of protein interaction data. 蛋白质相互作用数据的综合分析。
Proceedings. International Conference on Intelligent Systems for Molecular Biology Pub Date : 2000-01-01
M Fellenberg, K Albermann, A Zollner, H W Mewes, J Hani
{"title":"Integrative analysis of protein interaction data.","authors":"M Fellenberg,&nbsp;K Albermann,&nbsp;A Zollner,&nbsp;H W Mewes,&nbsp;J Hani","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>We have developed a method for the integrative analysis of protein interaction data. It comprises clustering, visualization and data integration components. The method is generally applicable for all sequenced organisms. Here, we describe in detail the combination of protein interaction data in the yeast Saccharomyces cerevisiae with the functional classification of all yeast proteins. We evaluate the utility of the method by comparison with experimental data and deduce hypotheses about the functional role of so far uncharacterized proteins. Further applications of the integrative analysis method are discussed. The method presented here is powerful and flexible. We show that it is capable of mining large-scale data sets.</p>","PeriodicalId":79420,"journal":{"name":"Proceedings. International Conference on Intelligent Systems for Molecular Biology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"21812148","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
Efficient attractor analysis based on self-dependent subsets of elements--an application to signal transduction studies. 基于元素自依赖子集的有效吸引子分析——在信号转导研究中的应用。
Proceedings. International Conference on Intelligent Systems for Molecular Biology Pub Date : 2000-01-01
M Cárdenas-García, J Lagunez-Otero, N Korneev
{"title":"Efficient attractor analysis based on self-dependent subsets of elements--an application to signal transduction studies.","authors":"M Cárdenas-García,&nbsp;J Lagunez-Otero,&nbsp;N Korneev","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>External signals are transmitted to the cells through receptors activating signal transduction pathways. These pathways form a complicated interconnected network, which is able to answer to different stimuli. Here we analyze an important pathway for oncogenesis namely RAS/MAPK signal transduction pathway. We show that the interaction of the elements of this pathway induces topological structure in the element set and that the knowledge of the topology simplifies the analysis of the set. With a computer algorithm, we isolate from a large and complex group, smaller, independent, more manageable subsets, and build their hierarchy. Subsets introduction makes easier the search for attractors in discrete dynamical system, it permits the prediction of final states for elements involved in signal transduction pathways.</p>","PeriodicalId":79420,"journal":{"name":"Proceedings. International Conference on Intelligent Systems for Molecular Biology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"21812200","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
A statistical method for finding transcription factor binding sites. 寻找转录因子结合位点的统计方法。
Proceedings. International Conference on Intelligent Systems for Molecular Biology Pub Date : 2000-01-01
S Sinha, M Tompa
{"title":"A statistical method for finding transcription factor binding sites.","authors":"S Sinha,&nbsp;M Tompa","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Understanding the mechanisms that determine the regulation of gene expression is an important and challenging problem. A fundamental subproblem is to identify DNA-binding sites for unknown regulatory factors, given a collection of genes believed to be coregulated, and given the noncoding DNA sequences near those genes. We present an enumerative statistical method for identifying good candidates for such transcription factor binding sites. Unlike local search techniques such as Expectation Maximization and Gibbs samplers that may not reach a global optimum, the method proposed here is guaranteed to produce the motifs with greatest z-scores. We discuss the results of experiments in which this algorithm was used to locate candidate binding sites in several well studied pathways of S. cerevisiae, as well as gene clusters from some of the hybridization microarray experiments.</p>","PeriodicalId":79420,"journal":{"name":"Proceedings. International Conference on Intelligent Systems for Molecular Biology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"21812565","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
Analysis of gene expression data with pathway scores. 基因表达数据的通路评分分析。
Proceedings. International Conference on Intelligent Systems for Molecular Biology Pub Date : 2000-01-01
A Zien, R Küffner, R Zimmer, T Lengauer
{"title":"Analysis of gene expression data with pathway scores.","authors":"A Zien,&nbsp;R Küffner,&nbsp;R Zimmer,&nbsp;T Lengauer","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>We present a new approach for the evaluation of gene expression data. The basic idea is to generate biologically possible pathways and to score them with respect to gene expression measurements. We suggest sample scoring functions for different problem specifications. We assess the significance of the scores for the investigated pathways by comparison to a number of scores for random pathways. We show that simple scoring functions can assign statistically significant scores to biologically relevant pathways. This suggests that the combination of appropriate scoring functions with the systematic generation of pathways can be used in order to select the most interesting pathways based on gene expression measurements.</p>","PeriodicalId":79420,"journal":{"name":"Proceedings. International Conference on Intelligent Systems for Molecular Biology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"21813100","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
Intelligent aids for parallel experiment planning and macromolecular crystallization. 智能辅助平行实验计划和大分子结晶。
Proceedings. International Conference on Intelligent Systems for Molecular Biology Pub Date : 2000-01-01
V Gopalakrishnan, B G Buchanan, J M Rosenberg
{"title":"Intelligent aids for parallel experiment planning and macromolecular crystallization.","authors":"V Gopalakrishnan,&nbsp;B G Buchanan,&nbsp;J M Rosenberg","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>This paper presents a framework called Parallel Experiment Planning (PEP) that is based on an abstraction of how experiments are performed in the domain of macromolecular crystallization. The goal in this domain is to obtain a good quality crystal of a protein or other macromolecule that can be X-ray diffracted to determine three-dimensional structure. This domain presents problems encountered in real-world situations, such as a parallel and dynamic environment, insufficient resources and expensive tasks. The PEP framework comprises of two types of components: (1) an information management system for keeping track of sets of experiments, resources and costs; and (2) knowledge-based methods for providing intelligent assistance to decision-making. The significance of the developed PEP framework is three-fold--(a) the framework can be used for PEP even without one of its major intelligent aids that simulates experiments, simply by collecting real experimental data; (b) the framework with a simulator can provide intelligent assistance for experiment design by utilizing existing domain theories; and (c) the framework can help provide strategic assessment of different types of parallel experimentation plans that involve different tradeoffs.</p>","PeriodicalId":79420,"journal":{"name":"Proceedings. International Conference on Intelligent Systems for Molecular Biology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"21811343","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
Spectrum alignment: efficient resequencing by hybridization. 光谱比对:高效的杂交重测序。
Proceedings. International Conference on Intelligent Systems for Molecular Biology Pub Date : 2000-01-01
I Pe'er, R Shamir
{"title":"Spectrum alignment: efficient resequencing by hybridization.","authors":"I Pe'er,&nbsp;R Shamir","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Recent high-density microarray technologies allow, in principle, the determination of all k-mers that appear along a DNA sequence, for k = 8 - 10 in a single experiment on a standard chip. The k-mer contents, also called the spectrum of the sequence, is not sufficient to uniquely reconstruct a sequence longer than a few hundred bases. We have devised a polynomial algorithm that reconstructs the sequence, given the spectrum and a homologous sequence. This situation occurs, for example, in the identification of single nucleotide polymorphisms (SNPs), and whenever a homologue of the target sequence is known. The algorithm is robust, can handle errors in the spectrum and assumes no knowledge of the k-mer multiplicities. Our simulations show that with realistic levels of SNPs, the algorithm correctly reconstructs a target sequence of length up to 2,000 nucleotides when a polymorphic sequence is known. The technique is generalized to handle profiles and HMMs as input instead of a single homologous sequence.</p>","PeriodicalId":79420,"journal":{"name":"Proceedings. International Conference on Intelligent Systems for Molecular Biology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"21812557","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
Genomic fold assignment and rational modeling of proteins of biological interest. 基因组折叠分配和合理建模的蛋白质的生物学利益。
Proceedings. International Conference on Intelligent Systems for Molecular Biology Pub Date : 2000-01-01
J M Sauder, R L Dunbrack
{"title":"Genomic fold assignment and rational modeling of proteins of biological interest.","authors":"J M Sauder,&nbsp;R L Dunbrack","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>The first available genome of a multicellular organism, C. elegans, was used as a test case for protein fold assignment using PSI-BLAST, followed by rational structure modeling and interpretation of experimental mutagenesis data in the context of collaboration with biologists. Similar results are demonstrated for human disease proteins with known polymorphisms.</p>","PeriodicalId":79420,"journal":{"name":"Proceedings. International Conference on Intelligent Systems for Molecular Biology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"21812560","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
首页 上一页 下一页 尾页
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学术官方微信