Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Approximate clustering of incomplete fingerprints

From MaRDI portal
Publication:954964
Jump to:navigation, search

DOI10.1016/j.jda.2007.01.004zbMath1162.68605OpenAlexW2080535496MaRDI QIDQ954964

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

clusteringapproximation algorithmsNP-hardnessoligonucleotide fingerprinting


Mathematics Subject Classification ID

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


Related Items (1)

Online clique clustering



Cites Work

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


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:954964&oldid=12931280"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 18:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki