检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王树林[1] 王戟[1] 陈火旺[1] 张波云[1]
机构地区:[1]国防科技大学计算机学院
出 处:《计算机科学》2006年第7期158-163,共6页Computer Science
基 金:国家自然科学基金资助项目(60233020)
摘 要:DNA序列可视化表示对于研究其结构与功能具有至关重要的意义,它有助于重复子序列的识别、内含子与外显子的区分以及DNA序列进化研究等等。本文首先介绍了生成DNA序列分形图像的Hao方法和经典的混沌游戏方法,然后深入分析和比较了这两种方法的异同点,并讨论了禁止子序列中回文子序列情况;紧接着,阐述了迭代函数系统产生分形吸引子的数学机理,并根据Moore自动机与迭代函数系统定义了混沌自动机,然后详细研究了以DNA序列驱动混沌自动机产生分形图像的方法;最后提出DNA序列三联密码子的分形图像表示方法,并对其进行了初步研究。The visual representation of DNA sequences plays a profound role in the research of DNA structure and its function, and it is especially helpful to the recognition of repeated subsequences, the partition into intron and exon, and the research of DNA sequences evolution, etc. At first, the two methods concerning Hao 's method and the classic chaos game representation method that can generate the fractal image of DNA sequences are introduced in this paper,and further the comparison and contrast between the two methods are provided in details. On the basis of these works, the palindromes are discussed in forbidden subsequences. Second,after the mathematical principle of iterated function system generating fractal attractor is introduced, the chaos automata is defined according to the Moore finite state machine together with iterated function system, and the method of chaos automata generating fractal image driven by DNA sequences is investigated deeply and further. At last, this paper proposes and investigates the method of generating fractal image driven by codon sequences in DNA sequences.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222