Complexity and improved heuristic algorithms for binary fingerprints clustering
From MaRDI portal
Publication:3406337
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
Cited in
(5)- Approximate clustering of incomplete fingerprints
- 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
- Clustering binary oligonucleotide fingerprint vectors for DNA clone classification analysis
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)