采用双向搜索算法的简单D0L系统反演研究  

The Reversion of the Bi-Directional Algorithm of a Simple DOL System

作　　者：胡乾苗[1] 叶庆卫[1] 文化峰[1] 励金祥[1] 

机构地区：[1]宁波大学信息科学与工程学院,浙江宁波315211

出　　处：《绍兴文理学院学报》2008年第9期19-22,共4页Journal of Shaoxing University

基　　金：浙江省教育厅科研基金资助项目(20051743);宁波大学科研基金资助项目(200590)

摘　　要：研究如何把D0L系统经过快速搜索,寻找出能够通过L系统迭代生长复原的D0L基因组.采用的方法是通过双向搜索算法寻找到基因的产生式,然后用除法运算得到完整的基因组.双向搜索算法的基本思想是在L系统字符串的头部寻找符合约束条件的字符子串,然后从尾部开始取等长字符子串进行比对,匹配后用约定条件来判定该子串是否为产生式.This study aims to make a reversionary algorithm of a simple DOL system by way of a quick searching method from an L - system＇ s string and found out that the DOL genome can regain the L - string. Whereas a production was found by bi - directional searching method and L- string was divided repeatedly, an entire gene was obtained. The bi - directional searching method means that a restricted substring is cut from the head of the long L - string and another substring of equal length was cut from the end. When both match and the result of division accord with the restrained condition, the substring is regarded as the production.

关 键 词：L系统 快速搜索算法 反演 双向搜索 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]