文件名称：MLCS algorithm code
文件大小：2.76MB
文件格式：ZIP
更新时间：2023-04-01 10:48:56
算法代码 数据挖掘
This is a fast MLCS algorithm for DNA sequence. Searching the Longest Common Subsequences of many sequences is called a Multiple Longest Common Subsequence (MLCS) problem which is a very fundamental and challenging problem in many fields of data mining. The existing algorithms cannot not applicable to problems with long and large-scale sequences due to their huge time and space consumption. To efficiently handle large-scale MLCS problems, a Path Recorder Directed Acyclic Graph (PRDAG) model and a novel Path Recorder Algorithm (PRA) are proposed.