检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,138 篇 会议
346 篇 期刊文献
15 册 图书

馆藏范围

1,499 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

739 篇 工学
- 605 篇 计算机科学与技术...
- 353 篇 电气工程
- 158 篇 软件工程
- 144 篇 生物工程
- 126 篇 生物医学工程（可授...
- 67 篇 控制科学与工程
- 58 篇 化学工程与技术
- 41 篇 信息与通信工程
- 11 篇 机械工程
- 8 篇 材料科学与工程（可...
- 8 篇 电子科学与技术（可...
- 7 篇 光学工程
- 7 篇 仪器科学与技术
- 6 篇 交通运输工程
- 5 篇 安全科学与工程
- 4 篇 冶金工程
566 篇 理学
- 510 篇 生物学
- 346 篇 数学
- 295 篇 统计学（可授理学、...
- 61 篇 化学
- 27 篇 系统科学
- 21 篇 物理学
98 篇 管理学
- 66 篇 管理科学与工程(可...
- 35 篇 图书情报与档案管...
- 9 篇 工商管理
73 篇 医学
- 63 篇 基础医学(可授医学...
- 35 篇 临床医学
- 24 篇 药学(可授医学、理...
- 10 篇 公共卫生与预防医...
35 篇 农学
- 32 篇 作物学
3 篇 法学
3 篇 教育学
2 篇 经济学
1 篇 文学
1 篇 艺术学

主题

590 篇 bioinformatics
264 篇 genomics
210 篇 proteins
176 篇 biological syste...
170 篇 computational bi...
169 篇 computational mo...
135 篇 biology computin...
120 篇 computational in...
114 篇 sequences
98 篇 dna
90 篇 gene expression
82 篇 feature extracti...
82 篇 artificial intel...
78 篇 databases
78 篇 machine learning
76 篇 predictive model...
74 篇 data mining
73 篇 diseases
65 篇 support vector m...
65 篇 humans

机构

14 篇 indian stat inst...
12 篇 jiangnan univ sc...
10 篇 bioinformatics r...
9 篇 indian stat inst...
8 篇 georgia state un...
7 篇 brock univ dept ...
6 篇 school of comput...
6 篇 ieee
6 篇 cent south univ ...
6 篇 univ guelph dept...
5 篇 univ south carol...
5 篇 tianjin univ col...
5 篇 georgia state un...
5 篇 univ bergamo dep...
5 篇 jilin univ sch a...
5 篇 osaka inst techn...
4 篇 tianjin univ col...
4 篇 computational sc...
4 篇 suzhou univ sci ...
4 篇 mathematics and ...

作者

17 篇 bandyopadhyay sa...
13 篇 rajapakse jagath...
13 篇 houghten sherida...
12 篇 daniel ashlock
11 篇 ashlock daniel
9 篇 j.c. rajapakse
9 篇 sheridan houghte...
9 篇 guo fei
8 篇 brown joseph ale...
8 篇 fogel gary b.
7 篇 tang jijun
7 篇 srinivas aluru
7 篇 shinn-ying ho
7 篇 nobile marco s.
7 篇 mohamad mohd sab...
6 篇 de rajat k.
6 篇 huseyin seker
6 篇 milone diego h.
6 篇 maji pradipta
6 篇 ding yijie

语言

1,458 篇 英文
22 篇 其他
4 篇 中文

检索条件"任意字段=IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology"

共 1499 条记录，以下是871-880 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Advances in bioinformatics and computational biology - 5th Brazilian symposium on bioinformatics, BSB 2010, Proceedings

Advances in Bioinformatics and Computational Biology - 5th B...

引用

5th Brazilian symposium on bioinformatics, BSB 2010

ISBN: (纸本)3642150594

The proceedings contain 10 papers. The topics discussed include: evolution of the long non-coding RNAs MALAT1 and MENβ/Ε;granger causality in systems biology: modeling gene networks in time series microarray data using vector autoregressive models;semi-supervised approach for finding cancer sub-classes on gene expression data;bounds on the transposition distance for lonely permutations;insights on haplotype inference on large genotype datasets;an SVM model based on physicochemical properties to predict antimicrobial activity from protein sequences with cysteine knot motifs;enabling annotation provenance in bioinformatics workflow applications;BAT: a new biclustering analysis toolbox;detection of protein domains in eukaryotic genome sequences;and discretization of flexible-receptor docking data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improved prediction of transcription binding sites from chromatin modification data

Improved prediction of transcription binding sites from chro...

引用

ieee symposium on computational intelligence and bioinformatics and computational biology (CIBCB)

作者： Kengo Sato Tom Whitington Timothy L. Bailey Paul Horton Graduate School of Frontier Sciences University of Tokyo Japan Institute for Molecular Bioscience University of Queensland Brisbane Australia Computational Biology Research Center Japan

ISBN: (纸本)9781424467662

In this paper we apply machine learning to the task of predicting transcription factor binding sites by combining information on multiple forms of chromatin modification with the binding strength DNA site predicted by a position weight matrix. We additionally explore the effect of incorporating auxiliary features such as the distance of the site to the nearest gene's transcription start site and the degree to which the site is conserved among related species. We approach the task as a classification problem, and show that both Naïve Bayes and Random Forests can provide substantial increases in the accuracy of predicted binding sites. Our results extend previous work which simply filtered candidate sites based on H3K4Me3 chromatin modification scores. In addition we apply feature selection to explore which forms of chromatin modification and which auxiliary features have predictive value for which transcription factors.

关键词： Pulse width modulation DNA Genomics bioinformatics Sequences Microorganisms Recruitment Filters Kernel Fungi

来源：评论

学校读者我要写书评

暂无评论

Issues with the PipeAlign phylogenomics toolkit in identifying protein subfamilies

Issues with the PipeAlign phylogenomics toolkit in identifyi...

引用

ieee symposium on computational intelligence and bioinformatics and computational biology (CIBCB)

作者： Christine Kehyayan Gregory Butler Department of Computer Science Concordia University Montreal QUE Canada

ISBN: (纸本)9781424467662

Automated protein function annotation is extremely important in computational biology for its low cost. Standard sequence similarity comparison methods for annotation have limited specificity in identifying orthologs and paralogs. Phylogenomic methods are gaining popularity for their role in identifying orthologs and paralogs with the help of evolutionary information and sequence data. Pipelines have been developed for phylogenomic classification of proteins. Two such pipelines are PhyloFacts and PipeAlign. Given a protein of interest, these pipelines identify functional subfamilies for the protein superfamily. Subfamilies hold orthologs and paralogs and can later be used to identify orthologous groups. We evaluate the performance of PipeAlign with respect to both consistency in the generated subfamilies and phylogeny. We use the predefined subfamilies of PhyloFacts as a reference to compare the generated subfamilies of related reference sequences in PipeAlign. In the consistency analysis, we compare the compositions of the generated functional subfamilies with different related reference sequences, and use the predefined PhyloFacts subfamilies for the corresponding sequences as a measure of consistency. In the phylogenetic analysis, we compare the evolutionary distances of the members of the same and different generated subfamilies from PipeAlign.

关键词： Phylogeny Sequences Pipelines Databases Hidden Markov models computational biology Cost function Protein engineering Availability Clustering methods

来源：评论

学校读者我要写书评

暂无评论

Structural properties of hub proteins

Structural properties of hub proteins

引用

2010 5th International symposium on Health Informatics and bioinformatics, HIBIT 2010

作者： Cukuroglu, Engin Ozkirimli, Elif Keskin, Ozlem Koc University Center for Computational Biology and Bioinformatics Sariyer 34450 Istanbul Turkey Bogazici University Chemical Engineering Department Bebek 34342 Istanbul Turkey

ISBN: (纸本)9781424459704

Protein-protein interaction networks are scale free networks with a few hub proteins that have many interaction partners in the network. In this work, we examined the flexibility of the hubs by using a structural perspective and compared date hubs, which bind their partners at different times, and party hubs, which bind their partners simultaneously, with non hub proteins. The flexibility of the proteins is evaluated using temperature factors. Party hubs are found to be more flexible than date hubs, which in turn are more flexible than non-hub proteins. These may explain how a hub interacts with its partners specifically. © 2009 ieee.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

Mixing patterns in a global influenza a virus network using whole genome comparisons

Mixing patterns in a global influenza a virus network using ...

引用

ieee symposium on computational intelligence and bioinformatics and computational biology (CIBCB)

作者： Adrienne E. Breland Mehmet H. Gunes Karen A. Schlauch Frederick C. Harris Department of Computer Science and Engineering University of Nevada Reno USA Department of Biochemistry and Molecular Biology University of Nevada Reno USA

Approximating `real' disease transmission networks through genomic sequence comparisons among pathogenic isolates is increasingly feasible with the current growth in genomic sequence data. Here, we derive a network from over 4,200 globally distributed influenza A virus isolates based on alignment-free sequence comparisons. We then employ network mixing pattern analysis to examine transmission probabilities between isolates from different global regions, host types, subtypes and collection years. While we can not use our results to describe the complete global network of influenza A virus, we present a novel analytical process. In addition, we describe some of the characteristics of this subset of currently available data. Most notable results are the high levels of inter regional links and the important role that avian species seem to play in non human global transmission.

关键词： Influenza Genomics bioinformatics Diseases Sequences Network topology Phylogeny RNA Viruses (medical) Genetic mutations

来源：评论

学校读者我要写书评

暂无评论

Integrating multiple scoring functions to improve protein loop structure conformation space sampling

Integrating multiple scoring functions to improve protein lo...

引用

ieee symposium on computational intelligence and bioinformatics and computational biology (CIBCB)

作者： Yaohang Li Ionel Rata Eric Jakobsson Department of Computer Science North Carolina Agriculture and Technical State University Greensboro USA Center for Biophysics and Computational Biology University of Illinois Urbana-Champaign Urbana-Champaign IL USA Department of Molecular and Integrative Physiology and National Center for Supercomputing Applications University of Illinois Urbana-Champaign Urbana-Champaign IL USA

ISBN: (纸本)9781424467662

In this article, we present a new protein structure modeling approach based on multi-scoring functions sampling. The rationale is to integrate multiple carefully-selected physics-or knowledge-based scoring functions to tolerate insensitivity and inaccuracy existing in an individual scoring function so as to improve protein structure modeling accuracy. We apply the multi-scoring function sampling approach to protein loop backbone structure modeling. Our computational results show that sampling the scoring function space of a physics-based soft-sphere potential function and a knowledge-based scoring function based on pairwise atoms distance has led to resolution improvement in the predicted decoy populations in a set of 12-residue benchmark loop targets.

关键词： Sampling methods Protein engineering USA Councils Spine Quantum mechanics Quantum computing Physics computing Thermodynamics Evolutionary computation Root mean square

来源：评论

学校读者我要写书评

暂无评论

Side effect machines for quaternary edit metric decoding

Side effect machines for quaternary edit metric decoding

引用

ieee symposium on computational intelligence and bioinformatics and computational biology (CIBCB)

作者： Joseph Alexander Brown Sheridan K. Houghten Daniel Ashlock The School of Computer Science University of Guelph ONT Canada

ISBN: (纸本)9781424467662

DNA edit metric codes are used as labels to track the origin of sequence data. This study is the first to treat sophisticated decoders for these error-correcting codes. Side effect machines can provide efficient decoding algorithms for such codes. Two methods for automatically producing decoding algorithms are presented. Side Effect Machines (SEMs), generalizations of finite state automata, are used in both. Single Classifier Machines (SCMs) use a single side effect machine to classify all words within a code. Locking Side Effect Machines (LSEMs) use multiple side effect machines to create a tree structured iterated classification. This study examines these techniques and provides new decoders for existing codes. Presented are ideas for best practises for the creation of these two types of new edit metric decoders. Codes of the form (n,M,d) 4 are used in testing due to their suitability for bioinformatics problems. A group of (12, 54-56, 7) 4 codes are used as an example of the process.

关键词： Error correction codes DNA Error correction Iterative decoding Sequences Biological information theory bioinformatics Organisms Automata Classification tree analysis

来源：评论

学校读者我要写书评

暂无评论

DGA: Decomposition with genetic algorithm for multiple sequence alignment

DGA: Decomposition with genetic algorithm for multiple seque...

引用

ieee symposium on computational intelligence and bioinformatics and computational biology (CIBCB)

作者： Farhana Naznin Ruhul Sarker Daryl Essam School of Engineering and Information Technology University of New South Wales Canberra ACT Australia

ISBN: (纸本)9781424467662

Multiple sequence alignment is one of the most important issues in molecular biology as it plays an important role such as in life saving drug design. In this paper, we divide given sequences into two or more subsequences and then combine them together in order to find better multiple sequence alignments by applying a new GA based approach to the combined sequences. We also introduce new ways of generating an initial population and of applying the genetic operators. We have carried out experiments for the BAliBASE benchmark database using the sum of pair objective function with the PAM250 score matrix. To evaluate our proposed approach, we have compared with well known methods such as T-Coffee, MUSCLE, MAFFT and ProbCons. The experimental results show that better multiple sequence alignments may be obtained with higher number of divisions, however the computation time increases with the number of decompositions. The overall performance of the proposed Decomposition with GA (DGA) method is better than the existing methods and the GA method (without decompositions).

关键词： Dissolved gas analysis Genetic algorithms Sequences Iterative algorithms Muscles Drugs Evolutionary computation computational modeling Simulated annealing Genetic mutations

来源：评论

学校读者我要写书评

暂无评论

Using decision trees to study the convergence of phylogenetic analyses

Using decision trees to study the convergence of phylogeneti...

引用

ieee symposium on computational intelligence and bioinformatics and computational biology (CIBCB)

作者： Grant Brammer Tiffani L. Williams Department of Computer Science and Engineering Texas A and M University College Station TX USA

ISBN: (纸本)9781424467662

In this paper, we explore the novel use of decision trees to study the convergence properties of phylogenetic analyses. A decision learning tree is constructed from the evolutionary relationships (or bipartitions) found in the evolutionary trees returned from a phylogenetic analysis. We treat evolutionary trees returned from multiple runs of a phylogenetic analysis as different classes. Then, we use the depth of a decision tree as a technique to measure how distinct the runs are from each other. Decision trees with shallow depth reflect non-convergence since the evolutionary trees can be classified with little information. Deep decision tree depths reflect convergence. We study Bayesian and maximum parsimony phylogenetic analyses consisting of thousands of trees. For some datasets studied here, a single distinguishing bipartition can classify the entire tree collection suggesting non-convergence of the underlying phylogenetic analysis. Thus, we believe that decision trees lead to new insights with the potential for helping biologists reconstruct more robust evolutionary trees.

关键词： Decision trees Convergence Phylogeny Bayesian methods Classification tree analysis Machine learning Sampling methods computational intelligence Heuristic algorithms Inference algorithms

来源：评论

学校读者我要写书评

暂无评论

Coupling between energy and residue position fluctuations in native proteins

Coupling between energy and residue position fluctuations in...

引用

2010 5th International symposium on Health Informatics and bioinformatics, HIBIT 2010

作者： Gur, Mert Erman, Burak Center for Computational Biology and Bioinformatics Koc University Istanbul 34450 Turkey

ISBN: (纸本)9781424459704

The coupling between energy fluctuations and positional fluctuations in molecular dynamics trajectories of Crambin at 310 K is studied. Coupling with energy fluctuation is evaluated for both atomic positions and residue positions. Couplings show values which fluctuate around the previously proposed theoretical value under harmonic approximation. The magnitude of these correlations is in agreement, on the average, with the harmonic approximation. Additionally coupling between energy fluctuations and atom-atom distance fluctuations are evaluated. This coupling indicates how much each interaction among different atoms/residues is correlated with the protein's total energy fluctuations. Some atom's/residue's interactions have shown outstanding correlation. Moreover coupling of residue fluctuations between different modes is studied. © 2009 ieee.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共150页 << < 84 85 86 87 88 89 90 91 92 93 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：