Clique-detection models in computational biochemistry and genomics

European Journal of Operational Research

Volumn 173, Issue 1, 2006, Pages 1-17

  Butenko, S ^a   Wilhelm, W E ^a  

^a Texas AandM University   (United States)

Author keywords

Clique detection; Computational biochemistry; Genomics; Optimization

Indexed keywords

BIOCHEMISTRY; COMPUTATIONAL METHODS; CONFORMAL MAPPING; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION;

CLIQUE-DETECTION; COMPUTATIONAL BIOCHEMISTRY; GENOME MAPPING DATA; GENOMICS; NONOVERLAPPING LOCAL ALIGNMENTS;

GENETIC ENGINEERING;

EID: 33748704060     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.05.026     Document Type: Article

References (61)

1. Abbas A., and Holmes S. Bioinformatics and management science: Some common tools and techniques. Operations Research 52 (2004) 165-190
2. Abello J., Pardalos P.M., and Resende M.G.C. On maximum clique problems in very large graphs. In: Abello J., and Vitter J.S. (Eds). External Memory Algorithms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 50 (1999), American Mathematical Society, Providence, RI 119-130
3. Abu-Khzam, F., Langston, M., Shanbhag, P., November 2003. Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization. In: International Conference on Parallel and Distributed Computing and Systems. Los Angeles, CA, pp. 563-568.
4. Arora, S., Safra, S., 1992. Approximating clique is NP-complete. In: Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science. Piscataway, NJ, pp. 2-13.
5. Arratia R., Lander E., Tavare S., and Waterman M. Genomic mapping by anchoring random clones: A mathematical analysis. Genomics 11 (1991) 806-827
6. Avondo-Bodeno G. Economic Applications of the Theory of Graphs (1962), Gordon and Breach Science Publishers, New York
7. Babel L. Finding maximum cliques in arbitrary and special graphs. Computing 46 (1991) 321
8. Bafna V., Narayanan B., and Ravi R. Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles). Discrete Applied Mathematics 71 (1996) 41-53
9. Bahadur D., Akutsu T., Tomita E., Seki T., and Fujiyama A. Point matching under non-uniform distortions and protein side chain packing based on an efficient maximum clique algorithm. Genome Informatics 13 (2002) 143-152
10. Balas E., and Yu C. Finding a maximum clique in an arbitrary graph. SIAM Journal of Computing 15 (1986) 1054-1068
11. Baldwin, N.E., Collins, R.L., Langston, M.A., Leuze, M.R., Symons, C.T., Voy, B.H., 2004. High performance computational tools for motif discovery. In: IEEE International Workshop on High Performance Computational Biology.
12. Berman P. A d/2-approximation for maximum weight independent set in d-claw free graphs. Proceedings of the 7th Scandinavian Workshop on Algorithmic Theory, Lecture Notes in Computer Science vol. 1851 (2000), Springer-Verlag 214-219
13. Blazewicz J., Formanowicz P., and Kasprzak M. Selected combinatorial problems of computational biology. European Journal of Operational Research 161 (2005) 585-597
14. Boginski V., Butenko S., and Pardalos P.M. On structural properties of the market graph. In: Nagurney A. (Ed). Innovation in Financial and Economic Networks (2003), Edward Elgar Publishers, London 29-45
15. Bomze I.M., Budinich M., Pardalos P.M., and Pelillo M. The maximum clique problem. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization (1999), Kluwer Academic Publishers, Dordrecht, The Netherlands 1-74
16. Bonizzoni P., Vedova G.D., Dondi R., and Li J. The haplotyping problem: An overview of computational models and solutions. Journal of Computer Science and Technology 18 (2003) 675-688
17. Brint A., and Willett P. Algorithms for the identification of three-dimensional maximal common substructures. Journal of Chemical Information and Computer Science 27 (1987) 152-158
18. Bron C., and Kerbosch J. Algorithm 457: Finding all cliques on an undirected graph. Communications of ACM 16 (1973) 575-577
19. Butenko, S., Pardalos, P.M., Sergienko, I.V., Shylo, V., Stetsyuk, P., in press. Estimating the size of correcting codes using extremal graph problems. In: Pearce, C. (Ed.), Optimization: Structure and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands, in press.
20. Carr, R., Lancia, G., Istrail, S., 2000. Branch-and-cut algorithms for independent set problems: Integrality gap and an application to protein structure alignment. Tech. Rep. SAND2000-2171, Sandia National Laboratories, Albuquerque, NM.
21. Carraghan R., and Pardalos P. An exact algorithm for the maximum clique problem. Operations Research Letters 9 (1990) 375-382
22. Chandru V., Sharma A.D., and Kumar V.A. The algorithms of folding proteins on lattices. Discrete Applied Mathematics 127 (2003) 145-161
23. Clote P., and Backofen R. Computational Molecular Biology (2000), Wiley
24. de Weese-Scott C., and Moult J. Molecular modeling of protein function regions. Proteins: Structure, Function, and Bioinformatics 55 (2004) 942-961
25. Frank-Kamenetskii M. Unraveling DNA the Most Important Molecule of Life (1997), Addison-Wesley, Reading, MA
26. Gardiner E., Artymiuk P., and Willett P. Clique-detection algorithms for matching three-dimensional molecular structures. Journal of Molecular Graphics and Modelling 15 (1997) 245-253
27. Gardiner E., Willett P., and Artymiuk P. Graph-theoretic techniques for macromolecular docking. Journal of Chemical Information and Computer Science 40 (2000) 273-279
28. Garey M., and Johnson D. Computers and Intractability: A Guide to the Theory of NP-completeness (1979), W.H. Freeman and Company, New York
29. Gendreau M., Picard J., and Zubieta L. An efficient implicit enumeration algorithm for the maximum clique problem. Lecture Notes Economical Mathematics Systems 304 (1988) 70
30. Ghose A.K., and Crippen G.M. Geometrically feasible binding modes of a flexible ligand molecule at the receptor-site. Journal of Computational Chemistry 6 (1985) 350-359
31. Godzik A., Sklonick J., and Kolinski A. A topology fingerprint approach to inverse protein folding problem. Journal of Molecular Biology 227 (1992) 227-238
32. Goldman, D., Istrail, S., Papadimitriou, C., 1999. Algorithmic aspects of protein structure similarity. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science. pp. 512-522.
33. Golender V., and Rozenblit A. Logical and Combinatorial Algorithms for Drug Design (1983), Research Studies Press, Letchworth
34. Greenberg H.J., Hart W.E., and Lancia G. Opportunities for combinatorial optimization in computational biology. INFORMS Journal on Computing 16 (2004) 211-231
35. Grindley H., Artymiuk P., Rice D., and Willett P. Identification of tertiary structure resemblance in proteins using a maximal common sub-graph isomorphism algorithm. Journal of Molecular Biology 229 (1993) 707-721
36. 1-ε{lunate}. Acta Mathematica 182 (1999) 105-142
37. Harley E., Bonner A., and Goodman N. Revealing hidden interval graph structure in STS-content data. Bioinformatics 15 (1999) 278-285
38. Harley E., Bonner A., and Goodman N. Uniform integration of genome mapping data using intersection graphs. Bioinformatics 17 (2001) 487-494
39. Heun V. Approximate protein folding in the HP side chain model on extended cubic lattices. Discrete Applied Mathematics 127 (2003) 163-177
40. Holliday J., and Willett P. Using a genetic algorithm to identify common structural features in sets of ligands. Journal of Molecular Graphics and Modelling 15 (1997) 221-232
41. In: Johnson D.S., and Trick M.A. (Eds). Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series vol. 26 (1996), American Mathematical Society, Providence, RI
42. Kato H., and Takahashi Y. SS3D-P2: A three dimensional substructure search program for protein motifs based on secondary structure elements. Computer Applications in the Biosciences 13 (1997) 593-600
43. Koike R., Kinoshita K., and Kidera A. Probabilistic description of protein alignments for sequences and structures. Proteins: Structure, Function, and Bioinformatics 56 (2004) 157-166
44. Kuhl F., Crippen G., and Friesen D. A combinatorial algorithm for calculating ligand binding. Journal Computational Chemistry 5 (1984) 24-34
45. Lancia, G., Bafna, V., Istrail, S., Lippert, R., Schwartz, R., 2001. Snps problems, complexity, and algorithms. In: ESA 2001. pp. 182-193.
46. Langston, M., Lin, L., Peng, X., Baldwin, N., Symons, C., Zhang, B., Snoddy, J., 2004. A combinatorial approach to the analysis of differential gene expression data. Tech. Rep. 04-514, Department of Computer Science, University of Tennessee, Knoxville, TN.
47. Martin Y., Bures M., Danaher E., DeLazzer J., Lico I., and Pavlik P.A. A fast new approach to pharmacophore mapping and its application to dopaminergic and benzodiazepine agonists. Journal of Computer-Aided Molecular Design 7 (1993) 83
48. McMorris F., Wang C., and Zhang P. On probe interval graphs. Discrete Applied Mathematics 88 (1998) 315-324
49. Moon J.W., and Moser L. On cliques in graphs. Israel Journal of Mathematics 3 (1965) 23-28
50. Needleman S.B., and Wunsch C.D. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48 (1970) 443-453
51. Pevzner P.A. Computational Molecular Biology: An Algorithmic Approach (Computational Molecular Biology) (2003), Bradford Book
52. Pevzner, Sze, S.-H., 2000. Combinatorial approaches to finding subtle signals in dna sequences. In: Proceedings of 8th International Conference on Intelligent Systems for Molecular Biology. pp. 269-278.
53. Rhodes N., Willett P., Calvert A., Dunbar J., and Humblet C. CLIP: Similarity searching of 3D databases using clique detection. Journal of Chemical Information and Computer Science 43 (2003) 338-443
54. Samudrala R., and Moult J. A graph-theoretic algorithm for comparative modeling of protein structure. Journal of Molecular Biology 279 (1988) 287-302
55. Samudrala R., and Moult J. Handling context-sensitivity in protein structures using graph theory: Bona fide prediction. Proteins: Structure, Function, and Genetics Suppl. 1 (1997) 43-49
56. Scharf M., Schneider R., Casari G., Bork P., Valencia A., Ouzounis C., and Sander C. GeneQuiz: A workbench for sequence analysis. In: Altmann R., Brutlag D., Karp P., Lathrop R., and Searls D. (Eds). Proceedings of the Second International Conference on Intelligent Systems in Molecular Biology (1994), AAAIPress, Menlo Park, CA 348-353
57. Schneider R., and Sander C. The HSSP database of protein structure-sequence alignments. Nucleic Acids Research 24 (1996) 201-205
58. Shindo M., and Tomita E. Simple algorithm for finding a maximum clique and its worst-case time complexity. Systems Computer 21 (1990) 1
59. Smith T.F., and Waterman M.S. Identification of common molecular subsequences. Journal of Molecular Biology 147 (1981) 195-197
60. Takahashi Y., Maeda S., and Sasaki S.-I. Automated recognition of common geometrical patterns among a variety of three-dimensional molecular structures. Analytica Chimica Acta 200 (1987) 363-377
61. Watson J., and Crick F. Genetic implications of the structure of deoxyribonucleic acid. Nature 171 (1953) 964-967