说明: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 mini <wswguilin> 在 上传 | 大小:2097152