基于LCS的逻辑重构算法的研究  

LOGICAL RE-ARCHITECTURE ALGORITHM BASED ON LCS

作　　者：黄玉林 刘丹[1] Huang Yulin;Liu Dan(School of Information and Computer Engineering,Northeast Forestry University,Harbin 150040,Heilongjiang,China)

机构地区：[1]东北林业大学信息与计算机工程学院,黑龙江哈尔滨150040

出　　处：《计算机应用与软件》2020年第4期280-284,308,共6页Computer Applications and Software

摘　　要：在逆向工程的研究中,逻辑重构中的等级簇聚合算法计算效率较低。为了改进计算效率,基于最长公共子序列(LCS)与高内聚的思想提出改进的逻辑重构算法。利用组件和数据表的关系以及存在交集的组件之间的相似程度来生成模块,并循环迭代,从而可以得到清晰的组件关系。与现有的等级簇聚合算法相比,该算法无需反复计算距离,时间复杂度更低,计算效率更高。In the study of reverse engineering,the agglomerative hierarchical algorithm in logical re-architecture has low computational efficiency.To improve the computational efficiency,an improved logic re-architecture algorithm is proposed based on the idea of the longest common subsequence(LCS)and high cohesion.It used the relationship between the component and the data table and the degree of similarity between the components of the intersection to generate a module.And a clear component relationship could be obtained through loop iteration.Compared with the existing agglomerative hierarchical algorithm,the proposed algorithm does not need to calculate the distance repeatedly.It has lower time complexity and higher computational efficiency.

关 键 词：逆向工程 逻辑重构 模块化 最长公共子序列 等级簇聚合算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]