Fingerprint clustering with bounded number of missing values

DOI10.1007/s00453-008-9265-0zbMath1205.68334arXivcs/0511082OpenAlexW1973297314WikidataQ57518523 ScholiaQ57518523MaRDI QIDQ5961971

Riccardo Dondi, Giancarlo Mauri, Gianluca Della Vedova, Paola Bonizzoni

Publication date: 16 September 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0511082

zbMATH Keywords

clusteringapproximation algorithmfingerprint vectors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Biochemistry, molecular biology (92C40) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Some APX-completeness results for cubic graphs
• Complexity of approximating bounded variants of optimization problems

This page was built for publication: Fingerprint clustering with bounded number of missing values