Erez Hartuv
Armin Schmitt
Ron Shamir
- 1.F. Alisadeh, R. M. Karp, L. A. Newberg, and D. K. Weisser. Physical mapping of chromosomes: A combinatorical problem in molecular biology. Algorithmica, 13:52-76, 1995.Google Scholar
Cross Ref
- 2.F. Buckley and F. Harary. Distance in graphs. Addisonwesley, 1990.Google Scholar
- 3.It. Drrnanac G. Lennon S. Drmanac I. Labat R. Crkvenjakov and H. Lehrach. Partial sequencing by oligohybridi~tion: Concept and applications in genome analysis. In Proceedings of the first international couference on dectrophoresis supercomputing and the human gerwme Edited by C. Cantor and H. Lira, pages 60-75, Singapore, 1991. World Scientific.Google Scholar
- 4.S. Drmanac and R. Drrnanac. Processing of cDNA and genomic kilobeze-size clones for massive screening mapping and sequencing by hybridization. Biotechni~es, 17:328--336, 1994.Google Scholar
- 5.S. Even. Graph algorithms. Computer Science Press, Potomac Maryland 20854, 1979. Google ScholarDigital Library
- 6.M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theor~ of NP-Completeness. W.H. Freeman and Co., San Francisco, 1979. Google ScholarDigital Library
- 7.P. Hansen and B. Jaumard. Cluster analysis and mathematical programming. Mathematical p~rramming, 79:191-215, 1997. Google ScholarDigital Library
- 8.J.A. Hartigan. Clustering algorithms. John Wiley and sons, 1975. Google ScholarDigital Library
- 9.E. Hartuv. Cluster analysis by highly connected subgraphs with applications to cDNA clustering. Master's thesis, Department of Computer Science, Tel Aviv University, August 1998.Google Scholar
- 10.N. Jardine and R. 5ibson. Mathematical taxonomy. John Wiley and sons, London, 1971.Google Scholar
- 11.D.R. Karger. Minimum cuts in near linear time. In Proc. ~ath annual A CM symposium on theory of computing, pages 56-63, 1996. Google ScholarDigital Library
- 12.L. Zhang W. Zhou V.E. Velculescu S.E. Kern R.H. Hruban S.R. Hamilton B. Vogelstein K.W. Kinzler. Gene expression profiles in normal and cancer cells. Science, 276:1268-1272, 1997.Google ScholarCross Ref
- 13.S. Meier-Ewert J. Lange H. Gerst R. Herwig A. 5chmitt J. Freund T. Elge R. Mott B. Herrmann H. Lehrach. Comparative gene expression profiling by oligonucleotide fingerprinting. Nucleic Acids Research, 26(9):2216-2223, 1998.Google ScholarCross Ref
- 14.G.5. Lennon and H. Lehrach. Hybridization analysis of arrayed eDNA libraries. Trends Genet, 7:60-75, 1991.Google ScholarCross Ref
- 15.D.W. Matula. The cohesive strength of graphs. In The many facets of graph theory, Lecture notes in Mathematics No. 110, Edited by G. Chartrand and S.F. Kapoor, pages 215-221, Berlin, 1969. Springer-Verlag.Google Scholar
- 16.D.W. Matula. Cluster analysis via graph theoretic techniques. In R.C Mullin K.B Reid and D.P Roselle, editors, Proc. Louisiana co~ference on combinatorics graph theory and computing, pages 199-212. University of manitoba Winnipeg, 1970.Google Scholar
- 17.D.W. Matula. k-Components, clusters and slicings in graphs. SIAM Y. App!. Math., 22(3):459-480, 1972.Google Scholar
- 18.D.W. Matula. Graph theoretic techniques for cluster analysis algorithms. In Classification and clustering Edited By Y. Van Ryzin, pages 95-129. Academic Press, 1977.Google Scholar
- 19.D.W. Matula. Determining edge connectivity in O(nm). In Proceedings lath IEEE symposis~m on foundations of computer science, pages 249-251, 1987.Google ScholarDigital Library
- 20.G. Mayraz and R. 5hamir. Construction of physical maps from oligonucleotide fingerprints data. In Proceedings of the Third Annual International Conference on Computational Molecular Biology (RECOMB '99). to appear. Google ScholarDigital Library
- 21.Mehlhorn and Naher. LF, DA: A platform for combinatorial and geometric computing. Communications of the A CM, 38, 1995. Google ScholarDigital Library
- 22.5. Meier-Ewert, R. Mott, and H. Lehrach. Gene identification by oligonucleotide fingerprinting-- a pilot study. Technical report, MPI, 1995.Google Scholar
- 23.F. Michiels, A. G. Craig, G. Zehetner, G. P. Smith, and H. Lehrach. Molecular approaches to genome analysis: a strategy for the construction of ordered overlapping clone libraries. CABIO$, 3(3):203-210, 1987.Google Scholar
- 24.A. Milosavljevic, Z. Strezoska, M. Zeremski, D. Grujic, T. Paunesku, and R. Crkvenjakov. Clone clustering by hybridization. Ge~omics, 27:83-89, 1995.Google ScholarCross Ref
- 25.B. Mirkin. Mathematical classification and clustering. Kluwer academic publishers, 1996.Google Scholar
- 26.H. Nasamochi and T. Ibaraki. Computing edge connectivity in multigraphs and capacitated graphs. SIAM Y. Disc. Math., 5:54-66, 1992. Google ScholarDigital Library
- 27.D. M. Platt. and T. I. Dix. Comparison of clone-ordering algorithms used in physical mapping. Genomics, 40:490- 492, 1997.Google ScholarCross Ref
- 28.S. Drmanac N. A. Stavropoulos I. Labat J. Vonau B. Hauser M. B. Soares and R. Drmanac. Gene-representing eDNA clusters defined by hybridization of $7419 clones from infant brain libraries with short oligonucleotide probes. Genotnics, 37:29-40, 1996.Google Scholar
- 29.R. R. Sokal. Clustering and classification: Background and current directions. In C!assi~cagion and clusgering Edited By Y. Van Ryzin, pages 1-15. Academic Press, 1977.Google Scholar
- 30.M. Stoer and F. Wagner. A simple Min-Cut algorithm. Journal of the A CM, 44(4):585-591, 1997. Google ScholarDigital Library
- 31.R. Drmanac S. Drmanac I. Labat R. Crkvenjakov A. Vicentic and A. Gemmell. Sequencing by hybridization: towards an automated sequencing of one milion M13 clones arrayed on membranes. Elecgrophor~sis, 13:566--573, 1992.Google ScholarCross Ref
- 32.Z. Wu and P,. Leahy. An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE transactions on pwttern anallVsis and roach{he inteU{~ence, 15(11):1101-1113, 1993. Google ScholarDigital Library
Index Terms
- An algorithm for clustering cDNAs for gene expression analysis
Recommendations
Statistical methods for gene set co-expression analysis
Motivation: The power of a microarray experiment derives from the identification of genes differentially regulated across biological conditions. To date, differential regulation is most often taken to mean differential expression, and a number of ...
A statistical method for identifying differential gene--gene co-expression patterns
Motivation: To understand cancer etiology, it is important to explore molecular changes in cellular processes from normal state to cancerous state. Because genes interact with each other during cellular processes, carcinogenesis related genes may ...
Comments