MLCS algorithm code

上传者: wswguilin | 上传时间: 2021-06-22 15:43:48 | 文件大小: 2.76MB | 文件类型: ZIP
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.

文件下载

资源详情

[{"title":"( 392 个子文件 2.76MB ) MLCS algorithm code","children":[{"title":"settings.txt <span style='color:#111;'> 121B </span>","children":null,"spread":false},{"title":"NondominantSorter.class <span style='color:#111;'> 5.80KB </span>","children":null,"spread":false},{"title":"DMHash.class <span style='color:#111;'> 3.45KB </span>","children":null,"spread":false},{"title":"MemoryMonitor.class <span style='color:#111;'> 1.11KB </span>","children":null,"spread":false},{"title":"SuccTables.class <span style='color:#111;'> 10.33KB </span>","children":null,"spread":false},{"title":"......","children":null,"spread":false},{"title":"<span style='color:steelblue;'>文件过多,未全部展示</span>","children":null,"spread":false}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明