指纹向量聚类问题的复杂性与改进启发式算法.PDFVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software, Vol.1 9, No.3, March 2008, pp .500−510 http://www.j DOI: 10.3724/SP.J.1001.2008.00500 Tel/Fax : +86-10 © 2007 by Journal of Software. All rights reserved. ∗ 指纹向量聚类问题的复杂性与改进启发式算法 1,2+ 2 1 1 2 刘培强 , 朱大铭 , 谢青松 , 范 辉 , 马绍汉 1( 山东工商学院 信息与电子工程学院, 山东 烟台 264005) 2 ( 山东大学 计算机科学技术学院, 山东 济南 250061) The Complexity and Improved Heuristic Algorithms for Binary Fingerprints Clustering 1,2+ 2 1 1 2 LIU Pei-Qiang , ZHU Da-Ming , XIE Qing-Song , FAN Hui , MA Shao-Han 1(School of Information Electronic Engineering, Shandong Institute of Business and Technology, Yantai 264005, China) 2 (School of computer science and technology, Shandong University, Jinan 250061, China) + Corresponding author: Phn: +86-535-6905395, E-mail: liupeiqiang@ Liu PQ, Zhu DM, Xie QS, Fan H, Ma SH. The complexity and improved heuristic algorithms for binary fingerprints clustering. Journal of Software, 2008,19(3):500−510. /1000-9825/19/500.htm Abstract: Binary fingerprints clustering is used in the classification analysis of gene expression data. It has important values in disease diagnosis. In this paper, we prove the binary fingerprints clustering problem for 2 missing values per fingerprint to be NP-Hard, and improve the Figueroa’s heuristic algorithm. The new algorithm improves the implementation method for the original algorithm. Firstly, we use the chained table to store the set