.png){kind=icon}
返回
Permutation Machines
.png){kind=icon}
PRE
AI
DOI：10.1021/acssynbio.5b00226.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We define a new inversion-based machine called a permuton of n genetic elements, which allows the n elements to be rearranged in any of the nc(n - 1)center dot(n - 2)center dot center dot center dot 2 = n! distinct orderings. We present two design algorithms for architecting such a machine. We define a notion of a feasible design and use the framework to discuss the feasibility of the permuton architectures. We have implemented our design algorithms in a freely usable web-accessible software for exploration of these machines. Permutation machines could be used as memory elements or state machines and explicitly illustrate a rational approach to designing biological systems.
Keyword:
invertase
permutation
finite state machine
algorithm
feasible design
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
3.9K
被引数:
1.2W
机构
引用论文
.png){kind=icon}
Associated Higgs-W-Boson Production at Hadron Colliders: A Fully Exclusive QCD Calculation at NNLO
OAAI
OAAI分享收藏分享收藏
查看更多内容