Approximate clustering of incomplete fingerprints

DOI10.1016/J.JDA.2007.01.004MaRDI QIDQ954964zbMATH OpenOpenAlexFDO

Authors B. E. Eshmatov

Publication date 18 November 2008

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2007.01.004

zbMATH Keywords

approximation algorithmsclusteringNP-hardnessoligonucleotide fingerprinting

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Approximation algorithms (68W25) Genetics and epigenetics (92D10)

Recommendations

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

Cites work

• Approximation algorithms for combinatorial problems
• Correlation clustering
• On dependent randomized rounding algorithms
• Positive linear programming, parallel approximation and PCP's

Cited in

(6)

• Clustering binary oligonucleotide fingerprint vectors for DNA clone classification analysis
• Online clique clustering
• Complexity and improved heuristic algorithms for binary fingerprints clustering
• Fingerprint Clustering with Bounded Number of Missing Values
• Fingerprint clustering with bounded number of missing values
• Missing value replacement in strings and applications

This page was built for publication: Approximate clustering of incomplete fingerprints

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