文件名称:gene
-
所属分类:
- 标签属性:
- 上传时间:2013-11-26
-
文件大小:741byte
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
基因串是由一串有限长度的基因所组成的,其中每一个基因都可以用26个英文大写字母中的一个来表示,不同的字母表示不同的基因类型。一个单独的基因可以生长成为一对新的基因,而可能成长的规则是通过一个有限的成长规则集所决定的。每一个成长的规则可以用三个大写英文字母A1A2A3来描述,这个规则的意思是基因A1可以成长为一对基因A2A3。
用大写字母S来表示一类称作超级基因的基因,因为每一个基因串都是由一串超级基因根据给出的规则所成长出来的。
请写一个程序,读入有限条成长的规则和一些我们想要得到的基因串,然后对于每个基因串,判断它是否可以由一个有限长度的超级基因串成长得出。如果可以,给出可成长为该基因串的最短超级基因串的长度。-Gene by a gene string is a string that consists of finite length, wherein each gene can be used in the 26 capital letters to indicate a different type of letters different genes. A single gene may be grown to be a new gene, the rule is likely to grow by a limited set of rules determined by the growth. Each rule can be used to grow three capital letters A1A2A3 to describe the meaning of the rule A1 gene is a gene can grow A2A3. Uppercase letter S to represent a class of genes called super-gene as a gene sequence are each composed of a string of super-gene grown out according to the given rules. Please write a program that reads the limited growth of the rules and want to get some of our gene cluster, and then for each gene cluster, to determine whether it is the growth of super-gene cluster consists of a finite length can be derived. If you can, given the length of the shortest that can grow super-gene cluster of genes strings.
用大写字母S来表示一类称作超级基因的基因,因为每一个基因串都是由一串超级基因根据给出的规则所成长出来的。
请写一个程序,读入有限条成长的规则和一些我们想要得到的基因串,然后对于每个基因串,判断它是否可以由一个有限长度的超级基因串成长得出。如果可以,给出可成长为该基因串的最短超级基因串的长度。-Gene by a gene string is a string that consists of finite length, wherein each gene can be used in the 26 capital letters to indicate a different type of letters different genes. A single gene may be grown to be a new gene, the rule is likely to grow by a limited set of rules determined by the growth. Each rule can be used to grow three capital letters A1A2A3 to describe the meaning of the rule A1 gene is a gene can grow A2A3. Uppercase letter S to represent a class of genes called super-gene as a gene sequence are each composed of a string of super-gene grown out according to the given rules. Please write a program that reads the limited growth of the rules and want to get some of our gene cluster, and then for each gene cluster, to determine whether it is the growth of super-gene cluster consists of a finite length can be derived. If you can, given the length of the shortest that can grow super-gene cluster of genes strings.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
gene.c
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.