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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

150 篇 会议
13 篇 期刊文献
9 册 图书

馆藏范围

172 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

136 篇 工学
- 109 篇 计算机科学与技术...
- 45 篇 生物工程
- 42 篇 生物医学工程（可授...
- 28 篇 软件工程
- 19 篇 化学工程与技术
- 11 篇 材料科学与工程（可...
- 10 篇 信息与通信工程
- 10 篇 控制科学与工程
- 9 篇 电气工程
- 7 篇 动力工程及工程热...
- 7 篇 电子科学与技术（可...
- 4 篇 力学（可授工学、理...
- 2 篇 建筑学
- 2 篇 土木工程
- 1 篇 机械工程
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 交通运输工程
87 篇 理学
- 72 篇 生物学
- 36 篇 数学
- 26 篇 化学
- 13 篇 物理学
- 7 篇 系统科学
- 7 篇 统计学（可授理学、...
6 篇 医学
- 6 篇 临床医学
- 5 篇 基础医学(可授医学...
- 5 篇 药学(可授医学、理...
6 篇 管理学
- 5 篇 图书情报与档案管...
1 篇 法学
- 1 篇 社会学
1 篇 农学

主题

49 篇 dna
8 篇 computational bi...
8 篇 computation by a...
8 篇 algorithm analys...
7 篇 artificial intel...
6 篇 dna computing
6 篇 data structures
6 篇 dynamic programm...
5 篇 discrete mathema...
5 篇 proteins
4 篇 self assembly
4 篇 dna arithmetic
4 篇 addition
4 篇 sticker system
4 篇 sequences
4 篇 algorithm
4 篇 rna
4 篇 complexity
3 篇 logarithmic numb...
3 篇 molecular progra...

机构

4 篇 university of ca...
4 篇 california insti...
4 篇 caltech pasadena...
3 篇 st marys univ de...
3 篇 college of elect...
3 篇 univ new mexico ...
3 篇 univ washington ...
2 篇 the university o...
2 篇 pob 605 laramie ...
2 篇 lab nacl computa...
2 篇 school of mathem...
2 篇 mit comp sci & a...
2 篇 school of electr...
2 篇 transnat univ li...
2 篇 univ memphis mem...
2 篇 tufts univ dept ...
2 篇 hasselt univ die...
2 篇 hamilton institu...
2 篇 school of electr...
2 篇 univ oxford dept...

作者

6 篇 seelig georg
6 篇 doty david
6 篇 lakin matthew r.
5 篇 phillips andrew
5 篇 winfree erik
5 篇 soloveichik davi...
4 篇 thachuk chris
4 篇 wang yanfeng
4 篇 condon anne
4 篇 arnold mark g.
3 篇 patitz matthew j...
3 篇 stefanovic darko
3 篇 konstantinidis s...
3 篇 ceze luis
3 篇 van den bussche ...
3 篇 woods damien
3 篇 gillis joris j. ...
3 篇 strauss karin
3 篇 brijder robert
3 篇 zhang xuncai

语言

172 篇 英文
1 篇 日文

检索条件"任意字段=15th International Conference on DNA Computing and Molecular Programming"

共 172 条记录，以下是151-160 订阅

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

详细简洁

排序：

the logic circuit design of fire alarm system device by dna strand displacement 12th

The logic circuit design of fire alarm system device by DNA ...

引用

12th international conference on Bio-Inspired computing: theories and Applications, BIC-TA 2017

作者： Wang, Yanfeng Li, Jixiang Huang, Chun Sun, Junwei Henan Key Lab of Information-Based Electrical Appliances Zhengzhou University of Light Industry Zhengzhou450002 China College of Electrical and Electronic Engineering Zhengzhou University of Light Industry Zhengzhou450002 China

ISBN: (纸本)9789811071782

dna strand displacement acted as a useful tool is most widely used in the majority computing system. In this paper, a four-input fire alarm system device based on dna strand displacement is designed. the whole reaction course is programmed and simulated in the software visual DSD, which presenting the superb simulation results with inputs and outputs through compiling the procedure for computation device. According to the results of the Visual DSD software, the method of dna strand displacement by dual-rail circuits is feasible to achieve more complex logic computation. this investigation on the basis of dna strand displacement by dual-rail circuits may have a great prospect for the development and application in the biological information processing, molecular computing, and so on. © Springer Nature Singapore Pte Ltd 2017.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Efficient Traversal of Beta-Sheet Protein Folding Pathways Using Ensemble Models 15th

Efficient Traversal of Beta-Sheet Protein Folding Pathways U...

引用

RECOMB - 15th Annual international conference on Research in Computational molecular Biology

作者： Shenker, Solomon O'Donnell, Charles W. Devadas, Srinivas Berger, Bonnie Waldispuehl, Jerome McGill Univ Sch Comp Sci McGill Ctr Bioinformat Montreal PQ H3A 2A7 Canada MIT AI Lab Cambridge MA 02139 USA MIT Dept Math Cambridge MA 02139 USA

ISBN: (纸本)9783642200359

molecular dynamics (MD) simulations can now predict ms-timescale folding processes of small proteins;however, this presently requires hundreds of thousands of CPU hours and is primarily applicable to short peptides with few long-range interactions. Larger and slower-folding proteins, such as many with extended beta-sheet structure, would require orders of magnitude more time and computing resources. Furthermore, when the objective is to determine only which folding events are necessary and limiting, atomistic detail MD simulations can prove unnecessary. Here, we introduce the program t Folder as an efficient method for modelling the folding process of large beta-sheet proteins using sequence data alone. To do so, we extend existing ensemble beta-sheet prediction techniques, which permitted only a fixed anti-parallel beta-barrel shape, with a method that predicts arbitrary beta-strand/beta-strand orientations and strand-order permutations. By accounting for all partial and final structural states, we can then model the transition from random coil to native state as a Markov process, using a master equation to simulate population dynamics of folding over time. thus, all putative folding pathways can be energetically scored, including which transitions present the greatest barriers. Since correct folding pathway prediction is likely determined by the accuracy of contact prediction, we demonstrate the accuracy of t Folder to be comparable with state-of-the-art methods designed specifically for the contact prediction problem alone. We validate our method for dynamics prediction by applying it to the folding pathway of the well-studied Protein G. With relatively very little computation time, t Folder is able to reveal critical features of the folding pathways which were only previously observed through time-consuming MD simulations and experimental studies. Such a result greatly expands the number of proteins whose folding pathways can be studied, while the algorithmic in

关键词： dynamic programming NP-completeness protein folding protein structure sequence analysis

来源：评论

学校读者我要写书评

暂无评论

dna Tile Self-Assembly for 3D-Surfaces: Towards Genus Identification 29

DNA Tile Self-Assembly for 3D-Surfaces: Towards Genus Identi...

引用

29th international conference on dna computing and molecular programming, dna 2023

作者： Becker, Florent Heydarshahi, Shahrzad Univ. Orléans INSA Centre Val de Loire LIFO EA 4022 OrléansF-45067 France

ISBN: (纸本)9783959772976

We introduce a new dna tile self-assembly model: the Surface Flexible Tile Assembly Model (SFTAM), where 2D tiles are placed on host 3D surfaces made of axis-parallel unit cubes glued together by their faces, called polycubes. the bonds are flexible, so that the assembly can bind on the edges of the polycube. We are interested in the study of SFTAM self-assemblies on 3D surfaces which are not always embeddable in the Euclidean plane, in order to compare their different behaviors and to compute the topological properties of the host surfaces. We focus on a family of polycubes called order-1 cuboids. Order-0 cuboids are polycubes that have six rectangular faces, and order-1 cuboids are made from two order-0 cuboids by substracting one from the other. thus, order-1 cuboids can be of genus 0 or of genus 1 (then they contain a tunnel). We are interested in the genus of these structures, and we present a SFTAM tile assembly system that determines the genus of a given order-1 cuboid. the SFTAM tile assembly system which we design, contains a specific set Y of tile types with the following properties. If the assembly is made on a host order-1 cuboid C of genus 0, no tile of Y appears in any producible assembly, but if C has genus 1, every terminal assembly contains at least one tile of Y. thus, for order-1 cuboids our system is able to distinguish the host surfaces according to their genus, by the tiles used in the assembly. this system is specific to order-1 cuboids but we can expect the techniques we use to be generalizable to other families of shapes. © Florent Becker and Shahrzad Heydarshahi;licensed under Creative Commons License CC-BY 4.0.

关键词： Assembly

来源：评论

学校读者我要写书评

暂无评论

Syntax-directed variational autoencoder for structured data 6

Syntax-directed variational autoencoder for structured data

引用

6th international conference on Learning Representations, ICLR 2018

作者： Dai, Hanjun Tian, Yingtao Dai, Bo Skiena, Steven Song, Le College of Computing Georgia Institute of Technology Singapore Department of Computer Science Stony Brook University United States Ant Financial China

Deep generative models have been enjoying success in modeling continuous data. However it remains challenging to capture the representations for discrete structures with formal grammars and semantics, e.g., computer programs and molecular structures. How to generate both syntactically and semantically correct data still remains largely an open problem. Inspired by the theory of compiler where the syntax and semantics check is done via syntax-directed translation (SDT), we propose a novel syntax-directed variational autoencoder (SD-VAE) by introducing stochastic lazy attributes. this approach converts the offline SDT check into on-the-fly generated guidance for constraining the decoder. Comparing to the state-of-the-art methods, our approach enforces constraints on the output space so that the output will be not only syntactically valid, but also semantically reasonable. We evaluate the proposed model with applications in programming language and molecules, including reconstruction and program/molecule optimization. the results demonstrate the effectiveness in incorporating syntactic and semantic constraints in discrete generative models, which is significantly better than current state-of-the-art approaches. © Learning Representations, ICLR 2018 - conference Track *** right reserved.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Research on the addition, subtraction, multiplication and division complex logical operations based on the dna strand displacement 1

引用

13th international conference on Bio-Inspired computing: theories and Applications, BIC-TA 2018

作者： Huang, Chun Wang, Yanfeng Zhou, Qinglei School of Information Engineering Zhengzhou University Zhengzhou450001 China College of Electrical and Electronic Engineering Zhengzhou University of Light Industry Zhengzhou450002 China

ISBN: (数字)9789811328299

ISBN: (纸本)9789811328282

In recent years, the development of biological computers has become faster and faster. In order to adapt to the development of science and technology, some novel logic circuits designs are necessary. In this paper, a complex molecular combinational logic circuit is designed to perform large-scale biological information processing by compound logic operation of addition, subtraction, multiplication and division. the design of compound logic operations of addition, subtraction, multiplication and division based on dna strand has four inputs signals and two output signals, and the dual-track design theory is used to perform the logic circuit operation, and the corresponding output result can be obtained in timely and accurately. the whole reaction progress of logic circuit operations can be programmed and simulated by the Visual DSD software. According to the simulation results of the Visual DSD software, the method of dna strand displacement is feasible to achieve more complex logic computations. this investigation for the addition, subtraction, multiplication and division complex logical operations of a binary number may have a great prospect for the development and application in the biological information processing, medicine diagnosis, molecular computing, and so on. © Springer Nature Singapore Pte Ltd. 2018.

关键词： Logic circuits

来源：评论

学校读者我要写书评

暂无评论

New methods for detecting lineage-specific selection

引用

10th Annual international conference on Research in Computational molecular Biology

作者： Siepel, Adam Pollard, Katherine S. Haussler, David Univ Calif Santa Cruz Ctr Biomol Sci & Engn Santa Cruz CA 95064 USA Univ Calif Santa Cruz Howard Hughes Med Inst Santa Cruz CA 95064 USA

ISBN: (纸本)3540332952

So far, most methods for identifying sequences tinder selection based on comparative sequence data have either assumed selectional pressures are the same across all branches of a phylogeny, or have focused on changes in specific lineages of interest. Here, we introduce a more general method that detects sequences that have either come under selection, or begun to drift, on any lineage. the method is based on a phylogenetic hidden Markov model (phylo-HMM), and does not require element boundaries to be determined a prion, making it particularly useful for identifying noncoding sequences. Insertions and deletions (indels) are incorporated into the phylo-HMM by a simple strategy that uses a separately reconstructed "indel history." To evaluate the statistical significance of predictions, we introduce a novel method for computing P-values based on prior and posterior distributions of the number of substitutions that have occurred in the evolution of predicted elements. We derive efficient dynamic-programming algorithms for obtaining these distributions, given a model of neutral evolution. Our methods have been implemented as computer programs called DLESS (Detection of LinEage-Specific Selection) and phyloP (phylogenetic P-values). We discuss results obtained with these programs on both real and simulated data sets.

关键词： dna sequences

来源：评论

学校读者我要写书评

暂无评论

Efficient Parameter Estimation for dna Kinetics Modeled as Continuous-Time Markov Chains 1

引用

25th international conference on dna computing and molecular programming, dna 2019

作者： Zolaktaf, Sedigheh Dannenberg, Frits Winfree, Erik Bouchard-CÃ´tÃ©, Alexandre Schmidt, Mark Condon, Anne University of British Columbia VancouverBC Canada California Institute of Technology PasadenaCA United States

ISBN: (数字)9783030268077

ISBN: (纸本)9783030268060

Nucleic acid kinetic simulators aim to predict the kinetics of interacting nucleic acid strands. Many simulators model the kinetics of interacting nucleic acid strands as continuous-time Markov chains (CTMCs). States of the CTMCs represent a collection of secondary structures, and transitions between the states correspond to the forming or breaking of base pairs and are determined by a nucleic acid kinetic model. the number of states these CTMCs can form may be exponentially large in the length of the strands, making two important tasks challenging, namely, mean first passage time (MFPT) estimation and parameter estimation for kinetic models based on MFPTs. Gillespieâ€™s stochastic simulation algorithm (SSA) is widely used to analyze nucleic acid folding kinetics, but could be computationally expensive for reactions whose CTMC has a large state space or for slow reactions. It could also be expensive for arbitrary parameter sets that occur in parameter estimation. Our work addresses these two challenging tasks, in the full state space of all non-pseudoknotted secondary structures of each reaction. In the first task, we show how to use a reduced variance stochastic simulation algorithm (RVSSA), which is adapted from SSA, to estimate the MFPT of a reactionâ€™s CTMC. In the second task, we estimate model parameters based on MFPTs. To this end, first, we show how to use a generalized method of moments (GMM) approach, where we minimize a squared norm of moment functions that we formulate based on experimental and estimated MFPTs. Second, to speed up parameter estimation, we introduce a fixed path ensemble inference (FPEI) approach, that we adapt from RVSSA. We implement and evaluate RVSSA and FPEI using the Multistrand kinetic simulator. In our experiments on a dataset of dna reactions, FPEI speeds up parameter estimation compared to inference using SSA, by more than a factor of three for slow reactions. Also, for reactions with large state spaces, it speeds up parameter

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Research on the Application of dna Cryptography in Electronic Bidding System 14th

Research on the Application of DNA Cryptography in Electroni...

引用

14th international conference on Bio-inspired computing: theories and Applications, BIC-TA 2019

作者： Liu, Jianxia Jiao, Yangyang Wang, Yibo Li, Hongxuan Zhang, Xuncai Cui, Guangzhao School of Information Management Nanjing University Nanjing210000 China School of Economics and Management Wuhan University Wuhan430072 China School of Electrical and Information Engineering Zhengzhou University of Light Industry Zhengzhou450002 China

ISBN: (纸本)9789811534140

With the rapid development of bidding market, a new type of bidding method-electronic bidding method has been widely used in the bidding market. this new-type of method is a program that the bidding is completed by graphics and textures. Generally, the electronic bidding provides doubles bidders with the data information of the transaction through the Internet. In this study we propose an information encryption and digital signature method based on dna cryptography which is combined with HASH function, symmetric encryption and asymmetric encryption comprehensively for the purpose of the information resources’ integrality, usability, security and reliability in the electronic bidding system. the results of the study show that our new method provides double guarantee for the bidding system under the role of symmetric encryption and asymmetric encryption used dna cryptography, and dna molecular encryption has the characteristics of electronic immunity, concealment, independent of mathematical problems, massive parallelism, etc. It provides a double guarantee for the bidding system. the security analysis results show that the algorithm can effectively protect the security and integrity of the bidder and bidder’s data information. © 2020, Springer Nature Singapore Pte Ltd.

关键词： dna

来源：评论

学校读者我要写书评

暂无评论

Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds 30

Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic H...

引用

30th international conference on dna computing and molecular programming, dna 30 2024

作者： Demaine, Erik D. Gomez, Timothy Grizzell, Elise Hecher, Markus Lynch, Jayson Schweller, Robert Shalaby, Ahmed Woods, Damien Massachusetts Institute of Technology United States University of Texas Rio Grande Valley United States Hamilton Institute Department of Computer Science Maynooth University Ireland

ISBN: (纸本)9783959773447

molecular programmers and nanostructure engineers use domain-level design to abstract away messy dna/RNA sequence, chemical and geometric details. Such domain-level abstractions are enforced by sequence design principles and provide a key principle that allows scaling up of complex multistranded dna/RNA programs and structures. Determining the most favoured secondary structure, or Minimum Free Energy (MFE), of a set of strands, is typically studied at the sequence level but has seen limited domain-level work. We analyse the computational complexity of MFE for multistranded systems in a simple setting were we allow only 1 or 2 domains per strand. On the one hand, with 2-domain strands, we find that the MFE decision problem is NP-complete, even without pseudoknots, and requires exponential time algorithms assuming SAT does. On the other hand, in the simplest case of 1-domain strands there are efficient MFE algorithms for various binding modes. However, even in this single-domain case, MFE is P-hard for promiscuous binding, where one domain may bind to multiple as experimentally used by Nikitin [Nat Chem., 2023], which in turn implies that strands consisting of a single domain efficiently implement arbitrary Boolean circuits. © Erik D. Demaine, Timothy Gomez, Elise Grizzell, Markus Hecher, Jayson Lynch, Robert Schweller, Ahmed Shalaby, and Damien Woods

关键词： Domain-based dna designs efficient algorithms fixed-parameter tractable minimum free energy NC NP-hard P-hard

来源：评论

学校读者我要写书评

暂无评论

Accelerating Self-Assembly of Crisscross Slat Systems 29

Accelerating Self-Assembly of Crisscross Slat Systems

引用

29th international conference on dna computing and molecular programming, dna 2023

作者： Doty, David Fleming, Hunter Hader, Daniel Patitz, Matthew J. Vaughan, Lukas A. University of California DavisCA United States University of Arkansas FayettevilleAR United States

ISBN: (纸本)9783959772976

We present an abstract model of self-assembly of systems composed of "crisscross slats", which have been experimentally implemented as a single-stranded piece of dna [21] or as a complete dna origami structure [28]. We then introduce a more physically realistic "kinetic" model and show how important constants in the model were derived and tuned, and compare simulation-based results to experimental results [21,28]. Using these models, we show how we can apply optimizations to designs of slat systems in order to lower the numbers of unique slat types required to build target structures. In general, we apply two types of techniques to achieve greatly reduced numbers of slat types. Similar to the experimental work implementing dna origami-based slats, in our designs the slats oriented in horizontal and vertical directions are each restricted to their own plane and sets of them overlap each other in square regions which we refer to as macrotiles. Our first technique extends their previous work of reusing slat types within macrotiles and requires analyses of binding domain patterns to determine the potential for errors consisting of incorrect slat types attaching at undesired translations and reflections. the second technique leverages the power of algorithmic self-assembly to efficiently reuse entire macrotiles which self-assemble in patterns following designed algorithms that dictate the dimensions and patterns of growth. Using these designs, we demonstrate that in kinetic simulations the systems with reduced numbers of slat types self-assemble more quickly than those with greater numbers. this provides evidence that such optimizations will also result in greater assembly speeds in experimental systems. Furthermore, the reduced numbers of slat types required have the potential to vastly reduce the cost and number of lab steps for crisscross assembly experiments. © David Doty, Hunter Fleming, Daniel Hader, Matthew J. Patitz, and Lukas A. Vaughan;licensed under Creative C

关键词： dna

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：