@Article{hartuv00algorithm,
  author    = {E. Hartuv and A. O. Schmitt and J. Lange and S. Meier-Ewert and H. Lehrach and R. Shamir},
  title     = {An algorithm for clustering {cDNA} fingerprints.},
  journal   = {Genomics},
  year      = {2000},
  volume    = {66},
  number    = {3},
  pages     = {249--256},
  abstract  = {Clustering large data sets is a central challenge in gene expression analysis. The hybridization of synthetic oligonucleotides to arrayed cDNAs yields a fingerprint for each cDNA clone. Cluster analysis of these fingerprints can identify clones corresponding to the same gene. We have developed a novel algorithm for cluster analysis that is based on graph theoretic techniques. Unlike other methods, it does not assume that the clusters are hierarchically structured and does not require prior knowledge on the number of clusters. In tests with simulated libraries the algorithm outperformed the Greedy method and demonstrated high speed and robustness to high error rate. Good solution quality was also obtained in a blind test on real cDNA fingerprints.},
  doi       = {10.1006/geno.2000.6187},
  keywords  = {Cluster Analysis; DNA Fingerprinting; DNA, Complementary; Evaluation Studies; Humans; Reproducibility of Results; Software Validation},
  owner     = {Sebastian},
  pmid      = {10873379},
  timestamp = {2007.04.20},
}

{"_id":"3JDzHD5xWo9PD6aGZ","bibbaseid":"hartuv-schmitt-lange-meierewert-lehrach-shamir-analgorithmforclusteringcdnafingerprints-2000","authorIDs":[],"author_short":["Hartuv, E.","Schmitt, A. O.","Lange, J.","Meier-Ewert, S.","Lehrach, H.","Shamir, R."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["E."],"propositions":[],"lastnames":["Hartuv"],"suffixes":[]},{"firstnames":["A.","O."],"propositions":[],"lastnames":["Schmitt"],"suffixes":[]},{"firstnames":["J."],"propositions":[],"lastnames":["Lange"],"suffixes":[]},{"firstnames":["S."],"propositions":[],"lastnames":["Meier-Ewert"],"suffixes":[]},{"firstnames":["H."],"propositions":[],"lastnames":["Lehrach"],"suffixes":[]},{"firstnames":["R."],"propositions":[],"lastnames":["Shamir"],"suffixes":[]}],"title":"An algorithm for clustering cDNA fingerprints.","journal":"Genomics","year":"2000","volume":"66","number":"3","pages":"249–256","abstract":"Clustering large data sets is a central challenge in gene expression analysis. The hybridization of synthetic oligonucleotides to arrayed cDNAs yields a fingerprint for each cDNA clone. Cluster analysis of these fingerprints can identify clones corresponding to the same gene. We have developed a novel algorithm for cluster analysis that is based on graph theoretic techniques. Unlike other methods, it does not assume that the clusters are hierarchically structured and does not require prior knowledge on the number of clusters. In tests with simulated libraries the algorithm outperformed the Greedy method and demonstrated high speed and robustness to high error rate. Good solution quality was also obtained in a blind test on real cDNA fingerprints.","doi":"10.1006/geno.2000.6187","keywords":"Cluster Analysis; DNA Fingerprinting; DNA, Complementary; Evaluation Studies; Humans; Reproducibility of Results; Software Validation","owner":"Sebastian","pmid":"10873379","timestamp":"2007.04.20","bibtex":"@Article{hartuv00algorithm,\n author = {E. Hartuv and A. O. Schmitt and J. Lange and S. Meier-Ewert and H. Lehrach and R. Shamir},\n title = {An algorithm for clustering {cDNA} fingerprints.},\n journal = {Genomics},\n year = {2000},\n volume = {66},\n number = {3},\n pages = {249--256},\n abstract = {Clustering large data sets is a central challenge in gene expression analysis. The hybridization of synthetic oligonucleotides to arrayed cDNAs yields a fingerprint for each cDNA clone. Cluster analysis of these fingerprints can identify clones corresponding to the same gene. We have developed a novel algorithm for cluster analysis that is based on graph theoretic techniques. Unlike other methods, it does not assume that the clusters are hierarchically structured and does not require prior knowledge on the number of clusters. In tests with simulated libraries the algorithm outperformed the Greedy method and demonstrated high speed and robustness to high error rate. Good solution quality was also obtained in a blind test on real cDNA fingerprints.},\n doi = {10.1006/geno.2000.6187},\n keywords = {Cluster Analysis; DNA Fingerprinting; DNA, Complementary; Evaluation Studies; Humans; Reproducibility of Results; Software Validation},\n owner = {Sebastian},\n pmid = {10873379},\n timestamp = {2007.04.20},\n}\n\n","author_short":["Hartuv, E.","Schmitt, A. O.","Lange, J.","Meier-Ewert, S.","Lehrach, H.","Shamir, R."],"key":"hartuv00algorithm","id":"hartuv00algorithm","bibbaseid":"hartuv-schmitt-lange-meierewert-lehrach-shamir-analgorithmforclusteringcdnafingerprints-2000","role":"author","urls":{},"keyword":["Cluster Analysis; DNA Fingerprinting; DNA","Complementary; Evaluation Studies; Humans; Reproducibility of Results; Software Validation"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","creationDate":"2019-11-19T16:50:42.068Z","downloads":0,"keywords":["cluster analysis; dna fingerprinting; dna","complementary; evaluation studies; humans; reproducibility of results; software validation"],"search_terms":["algorithm","clustering","cdna","fingerprints","hartuv","schmitt","lange","meier-ewert","lehrach","shamir"],"title":"An algorithm for clustering cDNA fingerprints.","year":2000,"dataSources":["C5FtkvWWggFfMJTFX"]}