Clustering in bioinformatics and drug discovery

Clustering in Bioinformatics and Drug Discovery

Volumn , Issue , 2010, Pages 1-203

  MacCuish, John D ^a   MacCuish, Norah E ^a  

^a NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85122905621     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/b10331     Document Type: Book

References (158)

1. M.R. Anderberg., Cluster Analysis for Applications. Academic Press, first edition, 1973.
2. J.C. Aude, Y. Diaz-Lazcoz, J.J. Codani, and J.L. Risler., Applications of the pyramidal clustering method to biological objects. Comput. Chem., 23(3-4):303-315, June 1999.
3. Open Babel., Open Babel: The Open Source Chemistry Toolbox http://openbabel.org/wiki/Main_Page, January 2010.
4. RCSB Protein Data Bank., RCSB Protein Data Bank http://www.rcsb.org/pdb/home/home.do, January 2010.
5. J.M. Barnard and G.M. Downs., Chemical fragment generation and clustering software. J. Chem. Inf. Model., 37(1):141-142, 1997.
6. S. Bates., Progress towards personalized medicine. Drug Discovery Today, November 2009.
7. P. Bertrand., Structural Properties of Pyramidal Clustering, volume 19. American Mathematical Society, 2008.
8. P. Bertrand., Systems of sets such that each set properly intersects at most one other set-Application to cluster analysis. Discrete Applied Mathematics, 156:1220-1236, 2008.
9. J.C. Bezdek., Pattern Recognition with Fuzzy Objective Function Algo-rithms. Plenum Press, 1981.
10. BKChem., BKChem http://bkchem.zirael.org, January 2010.
11. BLAST., BLAST: Basic Local Alignment Search Tool http://blast.ncbi.nlm.nih.gov/Blast.cgi, January 2010.
12. C. Bohm, B. Braunmuller, F. Krebs, and H. Kriegel., Epsilon grid order: an algorithm for the similarity join on massive high-dimensional data. SIGMOD Rec, 30(2):379-388, 2001.
13. B. Bollobas., Random Graphs. Cambridge University Press, second edition, 2001.
14. C. Bologa, T.K. Allu, M. Olah, M.A. Kappler, and T.I. Oprea., Descriptor collision and confusion: Toward the design of descriptors to mask chemical structures. J. Comp. Aid. Mol. Design, 19:625-635, 2005.
15. A. Bondy and U.S.R. Murty., Graph Theory. Springer, first edition, 2008.
16. I. Borg and P. Groenen., Modern Multidimensional Scaling. Springer, second edition, 2009.
17. J. Bradshaw and R. Sayle., Some thoughts on significant similarity and sufficient diversity http://www.daylight.com/meetings/emug97/Bradshaw/Significant_Similarity/Significant_Similarity.html, March 1997.
18. M.L. Brewer., Development of a spectral clustering model for the analysis of molecular data sets. J. Chem. Inf. Model., 47(5):1727-33, 2007.
19. R. Bro, E. Acar, and T. Kolda., Resolving the sign ambiguity in the singular value decomposition. J. Chemometrics, 2008.
20. R.D. Brown and Y.C. Martin., Use of structure-activity data to compare structure-based clustering methods and descriptors for use in compound selection. J. Chem. Inf. Comput. Sci., 36(3):572-584, 1996.
21. R.L. Burden and J.D. Faires., Numerical Analysis. Brooks Cole, eighth edition, 2004.
22. D. Butina., Unsupervised data base clustering based on daylight's fin-gerprint and tanimoto similarity: a fast and automated way to cluster small and large data sets. J. Chem. Inf Comput. Sci., 39(4):747-750, 1999.
23. CDK., The Chemistry Development Kit http://sourceforge.net/projects/cdk, January 2010.
24. M. Chavent, Y. Lechevallier, and O. Briant., DIVCLUS-T: A monothetic divisive hierarchical clustering method. Computational Statistics & Data Analysis, pages 687-701, 2007.
25. Digital Chemistry. Digital Chemistry-Products http://www. digitalchemistry.co.uk/prod_toolkit.html, January 2010.
26. X. Chen, A. Rusinko III, and S.S. Young., Recursive partitioning analysis of a large structure-activity data set using three-dimensional descriptors. J. Chem. Inf. Comput. Sci., pages 1054-1062, 1998.
27. Y. Cheng and G.M. Church., Biclustering of expression data. In Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, pages 93-103, 2000.
28. W.S. Cleveland., Visualizing Data. Hobart Press, 1993.
29. R.L. Cook., Stochastic sampling in computer graphics. ACM Transactions on Graphics, 5(1):51-72, 1986.
30. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein., Introduction to Algorithms. MIT Press, second edition, 2001.
31. T.F. Cox and M.A.A. Cox., Multidimensional Scaling, Second Edition. Chapman & Hall, 2000.
32. N.E. Day., Estimating the components of a mixture of two normal dis-tributions. Biometrika, 56:7-24, 1969.
33. H. de Fraysseix, J. Pach, and R. Pollack., How to draw a planar graph on a grid. Combinatorica, 10:41-51, 1990.
34. C. Ding, X. He, and H.D. Simon., On the equivalence of nonnegative matrix factorization and spectral clustering. In Proceedings of the SIAM International Conference on Data Mining. IEEE, 2005.
35. S.L. Dixon and R.T. Koehler., The hidden component of size in two-dimensional fragment descriptors: side effects on sampling in bioactive libraries. J. Med. Chem., 42(15):2887-2900, 1999.
36. R.O. Duda, P.E. Hart, and D.G. Stork., Pattern Classification. Wiley Interscience, second edition, 2001.
37. M.B. Eisen, P.T. Spellan, P.O. Brown, and D. Botstein., Cluster analysis and display of genome-wide expression patterns. In Proceedings of the National Academy of Science USA, volume 95, pages 14863-14868. National Academy of Science of the United States of America, 1998.
38. EMBL-EBI., The EMBL Nucleotide Sequence Database http://www. ebi.ac.uk/embl/, January 2010.
39. eMolecules., eMolecules Chemical Structure Drawing Search http:// www.emolecules.com, January 2010.
40. P. Erdos and A. Renyi., On random graphs. Publicationes Mathematicae Debrecen, 6:290-297, 1959.
41. B.S. Everitt., Cluster Analysis. Wiley, first edition, 1974.
42. B.S. Everitt, S. Landau, and M. Leese., Cluster Analysis. Wiley, fourth edition, 2009.
43. V. Faber., Clustering and the continuous fc-means algorithm. Los Alamos Sci., 22:138-144, 1994.
44. I. Fary., On straight line representation of planar graphs. Acta. Sci. Math. Szeged, 11:229-233, 1948.
45. G.S. Fishman., Monte Carlo Concepts, Algorithms, and Applications. Springer, first edition, 1996.
46. M.A. Fligner, J.S., Verducci, and P.E. Blower. A modification of the Jaccard-Tanimoto similarity index for diverse selection of chemical compounds using binary strings. Technometrics, 44(2):110-119, 2002.
47. National Center for Biotechnology Information., National Center for Biotechnology Information http://www.ncbi.nlm.nih.go, January 2010.
48. National Center for Biotechnology Information., PubChem http:// pubchem.ncbi.nlm.nih.gov, January 2010.
49. E.W. Forgy., Cluster analysis of multivariate data: efficiency vs inter- pretability of classifications. Biometrics, 21:768-769, 1965.
50. D.J. Galas and S.J. McCormack., editors. Genomic Technologies Present and Future. Caister Academic Press, 2002.
51. M.N. Gamito and S.C. Maddock., Accurate multidimensional Poisson- disk sampling. ACM Transactions on Graphics, 29(8), 2009.
52. J.E. Gentle., Random Number Generation and Monte Carlo Methods. Springer, second edition, 2004.
53. A.C. Gibbs and D.K. Agrafiotis., Chemical diversity: definition and quantification. In P. Bartlett and M. Entzeroth, editors, Exploiting Chemical Diversity for Drug Discovery, pages 139-160. The Royal Soce- ity of Chemistry, 2006.
54. J.C. Gower and P. Legendre., Metric and Euclidean properties of dis-similarity coefficients. J. Class., 3(3):5-48, 1986.
55. R.L. Graham, D.E. Knuth, and O. Patashnik., Concrete Mathematics. Addison-Wesley Professional, second edition, 1994.
56. J.A. Grant, M.A. Gallardo, and B.T. Pickup., A fast method of molecular shape comparison: a simple application of a gaussian description of molecular shape. J. Comb. Chem., 17(14):1653-1666, 1996.
57. J.A. Grant, J.A. Haigh, B.T. Pickup, A. Nicholls, and R.A. Sayle., Lingos, finite state machines and fast similarity searching. J. Chem. Inf Model., 46(5):1912-1918, 2006.
58. R. Guha, D. Dutta, D. Wild, and T. Chen., Counting cluster using R-NN curves. J. Chem. Inf. Model., 47(4):1308-1318, 2007.
59. M. Halkidi, Y. Batistakis, and M. Vazirgiannis., On clustering validation techniques. J. Intell. Inf. Sys., 17(2/3): 107-145, 2001.
60. J. Hammersley., Monte Carlo methods for solving multivariable problems. In Proceedings of the New York Academy of Science, volume 86, pages 844-874, 1960.
61. M. Haranczyk and J. Holliday., Comparison of similarity coefficients for clustering and compound selection. J. Chem. Inf. Comput. Sci., 48(3):819-828, 2008.
62. J.H. Hardin and F.R. Smietana., Automating combinatorial chemistry: a primer on benchtop robotic systems. Mol. Div., 1(4):270-274, 1996.
63. J. Hartigan., Clustering Algorithms. Wiley, 1975.
64. J.A. Hartigan., Direct clustering of a data matrix. J. Am. Stat. Assoc., 67(337):123-129, 1972.
65. J.A. Hartigan., Introduction. In P. Arabie, L.J. Hubert, and G. De Soete, editors, Clustering and Classification. World Scientific, 1996.
66. J.A. Hartigan and M.A. Wong., A K-means clustering algorithm. Appl. Stat., 28:100-108, 1979.
67. E. Hartuv and R. Shamir., A clustering algorithm based on graph con-nectivity. Inf. Proc. Let., 76(4-6):175-181, 2000.
68. T. Hastie, R. Tibshirani, and J. Friedman., The Elements of Statistical Learning. Springer, 2001.
69. S.R. Heller and A.D. McNaught., The IUPAC International Chemical Identifier (InChI). Chem. International, 31(1):7, 2009.
70. J. Herrero, A. Valencia, and J. Dopazo., A hierarchical unsupervised growing neural network for clustering gene expression patterns. Bioinformatics, 17:126-136, 2001.
71. J.D. Holliday, C.Y Hu, and P. Willett., Grouping of coefficients for the calculation of inter-molecular similarity and dissimilarity using 2D fragment bit-strings. Comb. Chem. High Throughput Screening, 11(2): 155-166, 2002.
72. J.D. Holliday, N. Salim, M. Whittle, and P. Willett., Analysis and display of the size dependence of chemical similarity coefficients. J. Chem. Inf Comput. Sci., 43(3):819-828, 2003.
73. Daylight Chemical Information Systems Inc., Daylight SMARTS Tutorial http://www.daylight.com/dayhtml_tutorials/languages/ smarts/index.html, December 2008.
74. M. Irwin and B. Shoichet., ZINC-a free database of commercially available compounds for virtual screening. J. Chem. Inf. Model., 45(1):177-82, 2005.
75. P. Jaccard., Distribution de la flore alpine dans le bassin des Dranses et dans quelques rgions voisines. Bulletin del la Socit Vaudoise des Sciences Naturelles, 0(37):241-272, 1901.
76. A.K. Jain and R.C. Dubes., Algorithms for Clustering Data. Prentice Hall, 1988.
77. D. Jiang, C. Tang, and A. Zhang., Cluster Analysis for Gene Expression Data: A Survey (2004) http://www.cse.buffalo.edu/DBGROUP/ bioinformatics/papers/survey.pdf, January 2004.
78. Jmol., Jmol:an open-source Java viewer for chemical structures in 3D http://www.jmol.org, January 2010.
79. M.A. Johnson and G.M. Maggiora., editors. Concepts and Applications of Molecular Similarity. Wiley, 1990.
80. I.T. Jolliffe., Principal Component Analysis. Springer-Verlag, second edition, 2002.
81. P.D. Karp., BioCyc Home http://www.biocyc.org, January 2010.
82. L. Kaufman and P.J. Rousseeuw., Finding Groups in Data. Wiley, 1990.
83. L.A. Kelly, S.P. Gardner, and M.J. Sutcliffe., An automated approach for clustering an ensemble of NMR-derived protein structures into con-formationally related subfamilies. Prot. Eng., 9:1063-1065, 1996.
84. L. Kocis and W. Whiten., Computational investigations of low- discrepancy sequences. ACM Trans. on Math. Soft., 23(2):266-294, 1997.
85. A. Kong and et al., Parental origin of sequence variants associated with complex diseases. Nature, pages 868-874, December 2009.
86. B. Kosata., Use of InChI and InChIKey in the XML gold book. Chem. Internat., 31(1), 2009.
87. H.-P. Kriegel, P. Kroger, and A. Zimek., Clustering high dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Transactions on Knowledge Discovery from Data, 3(1), 2009.
88. M. Kull and J. Vilo. Fast approximate hierarchical clustering using similarity heuristics. BioData Mining, 1(9), 2008.
89. M.S. Lajiness and V. Shanmugasundaram. Strategies for the identification and generation of informative compound sets. In J. Bajorath, editor, Chemoinformatics: Concepts, Methods, and Tools for Drug Discovery. Springer, 2004.
90. G.N. Lance and W.T. Williams. A general theory of classificatory sorting strategies: II. Clustering systems. Comput. J., 10:271-277, 1967.
91. A.R. Leach and V.J. Gillet. An Introduction to Chemoinformatics. Kluwer Academic Publishers, first edition, 2003.
92. P. Legendre and L. Legendre. Numerical Ecology. Elsevier, 1998.
93. Z. Lepp, C. Huang, and T. Okada. Finding key members in compound libraries by analyzing networks of molecules assembled by structural similarity. J. Chem. Inf. Model., 49(11):2429-2443, 2009.
94. V.I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady, 10:707-710, 1966.
95. Y. Li and S.M. Chung. Parallel bisecting k-means with prediction clustering algorithm. J. Supercomp., 39(1):19-37, 2007.
96. C.A. Lipinksi, F. Lombardo, B.W., Dominy, and P.J. Feeney. Experimental and computational approaches to estimate solubility and permeability in drug discovery and development settings. Adv. Drug Del. Rev, 23(23):3-25, 1997.
97. S.P. Lloyd. Least squares quantization in PCM. Bell Laboratories, Technical Report, 1957.
98. J. MacCuish, C. Nicolaou, and N.E. MacCuish. Ties in proximity and clustering compounds. J. Chem. Info. Comput. Sci., 41(1):134-146, 2001.
99. J.D. MacCuish, N.E. MacCuish, M. Hawrylycz, and M. Chapman. Quasi-Monte Carlo integration for the generation of molecular shape fingerprints. Manuscript.
100. J. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pages 281-297. University of California Press, 1967.
101. N. Mantel. The detection of disease clustering and a generalized regression approach. Cancer Res., 27:209-220, 1967.
102. E.J. Martin, J.M. Blaney, M.A. Siani, D.C. Spellmeyer, A.K. Wong, and W.H. Moos. Measuring diversity: experimental design of combinatorial libraries for drug discovery. J. Med. Chem., 38(9):1431-1436, 1995.
103. M. Meila and J. Shi. A random walks view of spectral segmentation. In 8th International Workshop on Artificial Intelligence and Statistics. Society for Artificial Intelligence and Statistics, 2001.
104. Inc. Mesa Analytics & Computing. SAESAR http://www.mesaac. com, January 2010.
105. G.W. Milligan. Ultrametric hierarchical clustering algorithms. Psy- chometrika, 44:343-346, 1979.
106. W.J. Morokoff and R.E. Caflisch. Quasi-Monte Carlo integration. J. Comput. Phys., 122(2):218-230, 1995.
107. C.A. Nicolaou, J.D. MacCuish, and S.Y. Tamura. A new multi-domain clustering algorithm for lead discovery that exploits ties in proximities. In 13th European Symposium on Quantitative Structure-Activity Rela-tionships, pages 486-495. Prous Science, 2000.
108. M.M. Olah, C.C. Bologna, and T.I. Oprea. Strategies for compound selection. Curr. Drug Disc. Tech., 1:211-220, 2004.
109. C.M. Papadimitriou. Computational Complexity. Addison-Wesley, 1992.
110. A Prinzie and D. Van Den Poel. Incorporating sequential information into traditional classification models by using an element/position- sensitive SAM. Decision Support Systems, 42(2):508-526, 2006.
111. G.J.E Rawlins. Compared to What. Computer Science Press, 1992.
112. ReNaBI. ReNaBI French bioinformatics platforms network http:// www.renabi.fr, January 2010.
113. PIR Protein Information Resource. PIR-PSD Database http://pir. georgetown.edu/pirwww/dbinfo/pir_psd.shtml, January 2010.
114. G.M. Rishton. Molecular diversity in the context of leadlikeness: compound properties that enable effective biochemical screening. Curr. Opin. in Chem. Bio., 40:340-351, 2008.
115. G.-C. Rota. The number of partitions of a set. Amer. Math. Monthly, 71:498-504, 1964.
116. N. Salim, J.D. Holliday, and P. Willett. Combination of fingerprint- based similarity coefficients using data fusion. J. Chem. Inf. Comput. Sci., 43(2):435-442, 2003.
117. W. Schnyder. Embedding planar graphs on the grid. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pages 138-148, 1990.
118. P.A. Schulte, R.L. Ehrenberg, and M. Singal. Investigation of occupational cancer clusters. Am. J. Public Health, pages 52-56, 1987.
119. R. Shamir and R. Sharan. Click: A clustering algorithm for gene expression analysis. In Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, 2000.
120. N.E. Shemetulskis, J.B. Dunbar, B.W. Dunbar, D.W. Moreland, and C. Humblet. Enhancing the diversity of a corporate database using chemical database clustering and analysis. J. Comp. Aided Mol. Des., pages 407-416, 1995.
121. N.E. Shemetulskis, D. Weininger, C.J. Blankley, J.J. Yang, and C. Hum-blet. Stigmata: an algorithm to determine structural commonalities in diverse datasets. J. Chem. Inf. Comput. Sci., 36(4):862-871, 1996.
122. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. on Patt. Anal. and Mach. Intel., 22(8):888-905, August 2000.
123. P. Shirley. Discrepancy as a quality measure for sample distributions. In Proceedings of Eurographics, pages 183-194. Association for Computing Machinery, 1991.
124. S.S. Skiena. Algorithm Design Manual. Springer, second edition, 2008.
125. P.H.A. Sneath. The application of computers to taxonomy. J. Gen. Microbiol., pages 201-226, 1957.
126. P.H.A. Sneath and R.R. Sokal. Numerical Taxonomy. Freeman, first edition, 1973.
127. R.R. Sokal and P.H.A. Sneath. Principles of Numerical Taxonomy. Freeman, first edition, 1963.
128. M. Steinbach, G. Karypis, and V. Kumar. A comparison of document clustering techniques. In Proceedings of World Text Mining Conference. KDD-2000, 2000.
129. Symyx. Symyx Products Cheminformatics http://www.symyx.com/ products/software/cheminformatics/index.jsp, January 2010.
130. T.T. Tanimoto. Internal Report. IBM Internal Report, November 17, 1957.
131. R.E. Tarjan. A hierarchical clustering algorithm using strongly connected components. Information Processing Letters, 14:26-29, 1982.
132. R.J. Taylor. Simulation analysis of experimental design strategies for screening random compounds as potential new drugs and agrochemicals. J. Chem. Inf. Comput. Sci., 35(1):59-67, 1995.
133. R Development Core Team. R: A Language and Environment for Statistical Computing http://www.R-project.org, 2008.
134. RSC Advancing the Chemical Sciences. ChemSpider Building community for chemists http://www.chemspider.com, January 2010.
135. R. Tibshirani, G. Walther, and T. Hastie. Estimating the number of clusters in a dataset via the gap statistic. J. Royal. Statist. Soc. B., 32(2):411-423, 2001.
136. E.R Tufte. The Visual Display of Quantitative Information. Graphics Press, second edition, 2001.
137. J.W. Tukey. Exploratory Data Analysis. Addison Wesley, 1977.
138. A. Tversky. Features of similarity. Psych. Rev., 84(4):327-352, 1957.
139. M.J. Vainio and M.S. Johnson. Generating conformer ensembles using a multiobjective genetic algorithm. J. Chem. Inf Model., 47:2462-2474, 2007.
140. M.J. Van der Laan and K.S. Pollard. A new algorithm for hybrid hier-archical clustering with visualization and the bootstrap. J. Stat. Plan. Inf, 117:275-303, 2003.
141. J.H. van Lint and R.M. Wilson. A Course in Combinatorics. Cambridge University Press, 1992.
142. M.E. Wall, A. Rechtsteiner, and L.M. Rocha. Singular value decomposition and principal component analysis. In D. Berrar, W. Dubitzky, and M. Granzow, editors, A Practical Approach to Microarray Data Analysis, pages 91-109. Springer, 2003.
143. Y. Wang and J. Bajorath. Development of a compound class-directed similarity coefficient that accounts for molecular complexity effects in fingerprint searching. J. Chem. Inf. Model., 49(6):1369-1376, 2009.
144. J.H. Ward. Hierarchical grouping to optimize and objective function. J. Amer. Stat. Assoc., 58:236-244, 1963.
145. D. Weininger. SMILES, a chemical language and information system. 1. Introduction to methodology and encoding rules. J. Chem. Inf. Comput. Sci., 28(1):31-36, 1988.
146. D. Weininger, A. Weininger, and J.L. Weininger. SMILES. 2. Algorithm for generation of unique SMILES notation. J. Chem. Inf Comput. Sci., 29(2):97-101, 1989.
147. M. Whittle, P. Willett, W. Klaffke, and P. van Noort. Evaluation of similarity measures for searching the dictionary of natural products database. J. Chem. Inf. Comput. Sci., 43(2):449-457, 2003.
148. D.J. Wild and C.J. Blankley. Comparison of 2D fingerprint types and hierarchy level selection methods for structural grouping using wards clustering. J. Chem. Inf. Comput. Sci., 40:155-162, 2000.
149. P. Willett. Similarity and Clustering in Chemical Information Systems. Research Studies Press, first edition, 1987.
150. P. Willett, J.M. Barnard, and G.M. Downs. Chemical similarity searching. J. Chem. Inf. Comput. Sci., 38:983-996, 1998.
151. R.J Wilson and J.J. Watkins. Graphs An Introductory Approach. John Wiley & Sons, first edition, 1990.
152. W.J. Wiswesser. A Line-Formula Chemical Notation. Crowell Co., New York edition, 1954.
153. L. Xue, J.W. Godden, and J. Bajorath. Evaluation of descriptors and mini-fingerprints for the identification of molecules with similar activity. J. Chem. Inf. Comput. Sci., 40(5):1227-1234, 2000.
154. K.Y. Yeung and W.L. Ruzzo. Principal component analysis for clustering gene expression data. Bioinformatics, 17(9):763-774, 2001.
155. L.A. Zadeh. Fuzzy sets. Inf. Control, 8(3):338-353, 1965.
156. R. Zass and A. Shashua. A unifying approach to hard and probabilistic clustering. In Proceedings of the International Conference on Computer Vision (ICCV) Beijing. IEEE, 2005.
157. C.T. Zhang, K.C. Chou, and G.M. Maggiora. Predicting protein structural classes from amino acid composition: application of fuzzy clustering. Prot. Eng., 8(5):425-435, 1995.
158. M. Zvelebil and J. Baum. Understanding Bioinformatics. Garland Science, first edition, 2008.