Complexity and improved heuristic algorithms for binary fingerprints clustering

DOI10.3724/SP.J.1001.2008.00500zbMATH Open1199.68299OpenAlexW2013158276MaRDI QIDQ3406337FDOQ3406337

Authors: Peiqiang Liu, Daming Zhu, Qingsong Xie, H. Fan, Shaohan Ma 

Publication date: 12 February 2010

Published in: Journal of Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3724/sp.j.1001.2008.00500

Recommendations

• Approximate clustering of incomplete fingerprints
• Fingerprint clustering with bounded number of missing values
• Fingerprint Clustering with Bounded Number of Missing Values
• Clustering binary oligonucleotide fingerprint vectors for DNA clone classification analysis
• scientific article; zbMATH DE number 2081029

zbMATH Keywords

gene expression dataclique partitionalgorithm complexityfingerprint clustering

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Cited In (5)

• Approximate clustering of incomplete fingerprints
• Clustering binary oligonucleotide fingerprint vectors for DNA clone classification analysis
• Fingerprint Clustering with Bounded Number of Missing Values
• Fingerprint clustering with bounded number of missing values
• Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult

This page was built for publication: Complexity and improved heuristic algorithms for binary fingerprints clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3406337)