Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism

ACM Journal of Experimental Algorithmics

Volumn 15, Issue 1, 2011, Pages

  Ullmann, Julian R ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Alldifferent constraint; Backtrack; Binary constraints; Bit vector; Constraint propagation; Constraint satisfaction; Domain reduction; Focus search; Forward checking; Graph indexing; Molecule matching; Prematching; Signature file; Subgraph isomorphism

Indexed keywords

EID: 84868275667     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1921701.1921702     Document Type: Article

References (78)

1. AARDAL, K. I., VAN HOESEL, S. P. M., KOSTER, A. M. C. A., MANNINO, C., AND SASSANO, A. 2007. Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153, 1, 79-129.
2. ARTYMIUK, P. J., SPRIGGS, R. V., AND WILLETT, P. 2005. Graph theoretic methods for the analysis of structural relationships in biological macromolecules. J. Am. Soc. Inf. Sci. Technol. 56, 5, 518-528.
3. BANDYOPADHYAY, D., HUAN, J., PRINS, J., SNOEYINK, J., WANG, W., AND TROPSHA, A. 2009. Identification of familyspecific residue packing motifs and their use for structure-based protein function prediction: I. method development. J. Comput. Aided Mol. Des. 23, 11, 773-784.
4. BESSIÈRE, C. 2006. Constraint Propagation. Handbook of Constraint Propagation. Elsevier, New York, http://www.lirmm.fr/~bessiere/stock/TR06020.pdf.
5. BESSIÉRE, C., MESEGUER, P., FREUDER, E. C., AND LARROSA, J. 2002. On forward checking for non-binary constraint satisfaction. Artif. Intell. 141, 1, 205-224.
6. BESSIÉRE, C., RÉGIN, J.-C., YAP, R. H. C., AND ZHANG, Y. 2005. An optimal coarse-grained arc consistency algorithm. Artif. Intell. 165, 2, 165-185.
7. BESSIÈRE, C., STERGIOU, K., AND WALSH, T. 2008. Domain filtering consistencies for non-binary constraints. Artif. Intell. 172, 6-7, 800-822.
8. BOUSSEMART, F., HEMERY, F., AND LECOUTRE, C. 2004. Revision ordering heuristics for the constraint satisfaction problem. In Proceedings of the 1st International Workshop on Constraint Propagation and Implementation. 29-43. http://www.cril.univ-artois.fr/~lecoutre/research/publications/2004/CPW2004.pdf.
9. BOUSSEMART, F., HEMERY, F., LECOUTRE, C., AND SÄIS, L. 2004. Boosting systematic search by weighting constraints. In Proceedings of the 16th European Conference on Artificial Intelligence. Springer, Berlin, 146-150. http://www.cril.univ-artois.fr/~lecoutre/research/publications/2004/ECAI2004.pdf.
10. BOUTSELAKIS, H., DIMITROPOULOS, D., FILLON, J., GOLOVIN, A., HENRICK, K., HUSSAIN, A., IONIDES, J., JOHN, M., KELLER, P. A., ET AL. 2003. MSD: The European Bioinformatics Institute macromolecular structure database. Nucleic Acids Res. 31, 1, 458-462.
11. BRIGGS, P. AND TORCZON, L. 1993. An efficient representation for sparse sets. ACM Lett. Program. Lang. Syst. 2, 1-4, 59-69.
12. BROWN, N. 2009. Chemo-informatics: An introduction for computer scientists. ACM Comput. Surv. 41, 2, 1-38.
13. CHANG, C. C. AND LEE, S. Y. 1991. Retrieval of similar pictures on pictorial databases. Pattern Recogn. 24, 7, 675-681.
14. CHENG, J., KE, Y., AND NG, W. 2009. Efficient query processing on graph databases. ACM Trans. Datab. Syst. 34, 1, 1-48.
15. CHENG, K. C. AND YAP, R. H. 2008. Maintaining arc consistency on ad-hoc r-ary constraints. In Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming. Springer, Berlin, 509-523.
16. CHENG, K. C. AND YAP, R. H. 2010. An mdd-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints. Constraints 15, 2, 265-304.
17. CHISHOLM, J. A. AND MOTHERWELL, S. 2004. A new algorithm for performing three-dimensional searches of the Cambridge structural database. J. Appl. Crystallogr. 37, 331-334.
18. th International Conference on Tools with Artificial Intelligence. IEEE, Los Alamitos, CA, 252-257.
19. CHOU, Y.-Y. AND SHAPIRO, L. G. 1998. Probabilistic relational indexing. In Proceedings of 14th International Conference on Pattern Recognition. Springer, Berlin, 1331-1335.
20. CONTE, D., FOGGIA, P., SANSONE, C., AND VENTO, M. 2004. Thirty years of graph matching in pattern recognition. Int. J. Patt. Recognit. Artif. Intell. 18, 3, 265-298.
21. COOK, S. A. 1971. The complexity of theorem-proving procedures. In Proceedings of the 3rd Symposium on Theory of Computing. ACM, New York, 151-158.
22. CORDELLA, L. P., FOGGIA, P., SANSONE, C., AND VENTO, M. 2004. A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans. Patt. Anal. Mach. Intell. 26, 10, 1367-1372.
23. CORNEIL, D. AND KIRKPATRICK, D. 1980. A theoretical analysis of various heuristics for the graph isomorphism problem. SIAM J. Comput. 9, 2, 281-297.
24. Daylight Chemical Information Systems, Inc. 2007. http://www.daylight.com/dayhtml/doc/theory/theory. finger.html. See Section 6.1.2.
25. DE LA BRIANDAIS, R. 1959. File searching using variable length keys. In Proceedings of the Western Joint Computer Conference. 295-298.
26. DURAND, P., LABARRE, L., MEIL, A., DIVO, J.-L., VANDENBROUCK, Y., VIARI, A., AND WOJCIK, J. 2006. Genolink: A graph-based querying and browsing system for investigating the function of genes and proteins. http://www.biomedcentral.com/1471-2105/7/21.
27. FOGGIA, P., SANSONE, C., AND VENTO, M. 2001. A performance comparison of five algorithms for graph isomorphism. In Proceedings of the 3rd Workshop on Graph-Based Representation. http://www.amalfi.dis.unina.it/people/vento/lavori/gbr01bm.pdf.
28. FOWLER, G., HARALICK, R. M., GRAY, F. G., FEUSTEL, C., AND GRINSTEAD, C. 1983. Efficient graph automorphism by vertex partitioning. Artif. Intell. 21, 1-2, 245-269.
29. GENT, I. P., MACINTYRE, E., PROSSER, P., SMITH, B. M., ANDWALSH, T. 2001. Random constraint satisfaction: Flaws and structure. Constraints 6, 4, 345-372.
30. GIUGNO, R. AND SHASHA, D. 2002. Graphgrep: A fast and universal method for querying graphs. In Proceedings of the 16th International Conference on Pattern Recognition. Springer, Berlin, 112-115.
31. GOLOMB, S. W. AND BAUMERT, L. D. 1965. Back-track programming. J. ACM 12, 4, 516-524.
32. GOMES, C. P., SELMAN, B., CRATO, N., AND KAUTZ, H. 2000. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Autom. Reason. 24, 1-2, 67-100.
33. HARALICK, R. M. AND ELLIOTT, G. 1980. Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14, 263-313.
34. HASSAN, T. 2009. User-guided wrapping of pdf documents using graph matching techniques. In Proceedings of the 10th International Conference on Document Analysis and Recognition. IEEE, Los Alamitos, CA, 631-635.
35. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 4, 225-231.
36. HULUBEI, T. AND O'SULLIVAN, B. 2006. The impact of search heuristics on heavy-tailed behaviour. Constraints 11, 2-3, 159-178.
37. JIANG, H., WANG, H., YU, P. S., AND ZHOU, S. 2007. GString: A novel approach for efficient search in graph databases. In Proceedings of the International Conference on Data Engineering. IEEE, Los Alamitos, CA, 566-575.
38. KLUKAS, C., KOSCHÜTZKI, D., AND SCHREIBER, F. 2005. Graph pattern analysis with pattern-gravisto. J. Graph Algor. Appl. 9, 1, 19-29.
39. KNUTH, D. E. 2000. Dancing links. In Millennial Perspectives in Computer Science, J. Davies, W. Roscoe, and J. Woodcock, Eds., Palgrave, Houndmills, Basingstoke, Hampshire, UK, 187-214.
40. KOHLER, E., MORRIS, R., AND CHEN, B. 2002. Programming language optimizations for modular router configurations. In Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems. ACM, New York, 251-263.
41. LARROSA, J. AND VALIENTE, G. 2002. Constraint satisfaction algorithms for graph pattern matching. Math. Struct. Compt. Sci. 12, 4, 403-422.
42. LEACH, A. R. AND GILLET, V. J. 2003. An Introduction to Chemo-Informatics. Kluwer Academic Publishers, Dordrecht, The Netherlands.
43. LECOUTRE, C. 2008. Optimization of simple tabular reduction for table constraints. In Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming. Springer-Verlag, Berlin, Heidelberg, 128-143.
44. LECOUTRE, C. 2009. Constraint Networks: Techniques and Algorithms. John Wiley and Sons, Hoboken, NJ.
45. LECOUTRE, C. AND VION, J. 2008. Enforcing arc consistency using bitwise operations. Constraint Program. Lett. 2, 21-35.
46. LYNCE, I. AND MARQUES-SILVA, J. P. 2003. An overview of backtrack search satisfiability algorithms. Ann. Math. Artificial Intell. 37, 3, 307-326.
47. MACKWORTH, A. K. 1977. Consistency in networks of relations. Artif. Intell. 8, 1, 99-118.
48. MCGREGOR, J. J. 1979. Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inf. Sci. 19, 229-250.
49. MCKAY, B. 2009. Nauty user's guide (version 2.4). http://cs.anu.edu.au/~bdm/nauty/nug.pdf.
50. MESSMER, B. T. AND BUNKE, H. 2000. Efficient subgraph isomorphism detection: A decomposition approach. IEEE Trans. Knowl. Data Eng. 12, 2, 307-323.
51. NAANAA, W. 2009. A domain decomposition algorithm for constraint satisfaction. J. Exp. Algor. 13, 1.13-1.23.
52. PROSCHAK, E., WEGNER, J. K., SCHÜLLER, A., SCHNEIDER, G., AND FECHNER, U. 2007. Molecular query language (mql)-a context-free grammar for substructure matching. J. Chem. Inf. Model 47, 2, 295-301.
53. PROSSER, P. 1996. An empirical study of phase transitions in binary constraint satisfaction problems. Artif. Intell. 81, 1-2, 81-109.
54. SABIN, D. AND FREUDER, E. 1994. Contradicting conventional wisdom in constraint satisfaction. In Proceedings of the 2nd International Workshop on Principles and Practice of Constraint Programming. Springer-Verlag, Berlin, 10-20.
55. SABIN, D. AND FREUDER, E. 1997. Understanding and improving the MAC algorithm. In Proceedings of the Conference on Principles and Practice of Constraint Programming. Springer-Verlag, Berlin, 167-181.
56. SCHULTE, C. 1999. Comparing trailing and copying for constraint programming. In Proceedings of the International Conference on Logic Programming. Massachusetts Institute of Technology, Cambridge, MA, 275-289.
57. SHANG, H., ZHANG, Y., LIN, X., AND YU, J. X. 2008. Taming verification hardness: An efficient algorithm for testing subgraph isomorphism. In Proceedings of the 34th International Conference on Very Large Databases. ACM, New York, 364-375.
58. SHASHA, D., WANG, J. T. L., AND GIUGNO, R. 2002. Algorithmics and applications of tree and graph searching. In Proceedings of the 21st Symposium on Principles of Database Systems. ACM, New York, 39-52.
59. SMITH, B. M. AND DYER, M. 1996. Locating the phase transition in binary constraint satisfaction problems. Artif. Intell. 81, 155-181.
60. SOLNON, C. 2010. AllDifferent-based filtering for subgraph isomorphism. Artif. Intell. 174, 12-13, 850-864.
61. TARJAN, R. AND YANNAKAKIS, M. 1984. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13, 566-579.
62. ULLMANN, J. R. 1965. Parallel recognition of idealized line characters. Kybernetik 2, 5, 221-226. http://www.visionbib.com/papers/1965/Kybernetik65.pdf;
63. http://www.visionbib.com/papers/1965/Kybintro.pdf.
64. ULLMANN, J. R. 1976. An algorithm for subgraph isomorphism. J. ACM 23, 1, 31-42.
65. ULLMANN, J. R. 1977. A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words. Comput. J. 20, 2, 141-147.
66. ULLMANN, J. R. 2007. Partition search for non-binary constraint satisfaction. Inf. Sci. 177, 18, 3639-3678.
67. WALLACE, R. J. AND FREUDER, E. C. 1992. Ordering heuristics for arc consistency algorithms. In Proceedings of the 9th Canadian Conference on Artificial Intelligence. 163-169.
68. WILLETT, P. 1999. Matching of chemical and biological structures using subgraph and maximal common subgraph isomorphism algorithms. In Rational Drug Design, D. G. Truhlar, W. J. Howe, A. J. Hopfinger, J. D., Blaney, and R. Dammkoehler, Eds., Springer-Verlag, Berlin, 11-38.
69. WILLETT, P. 2005. Chemoinformatics techniques for data mining in files of two-dimensional and three-dimensional chemical molecules. In Proceedings of the 3rd Conference on the Foundations of Information Science, M. Petitjean. MDPI, Basel, Switzerland. http://www.mdpi.org/fis2005/proceedings.html.
70. WILLETT, P. 2008. From chemical documentation to chemo-informatics: 50 years of chemical information science. J. Inf. Sci. 34, 4, 477-499.
71. WILLETT, P., BARNARD, J. M., AND DOWNS, G. M. 1998. Chemical similarity searching. J. Chem. Inf. Comput. Sci. 38, 6, 983-996.
72. YAN, X., YU, P. S., AND HAN, J. 2005. Graph indexing based on discriminative frequent structure analysis. ACM Trans. Datab. Syst. 30, 4, 960-993.
73. YAN, X., ZHU, F., YU, P. S., AND HAN, J. 2006. Feature-based similarity search in graph structures. ACM Trans. Datab. Syst. 31, 4, 1418-1453.
74. ZAMPELLI, S., DEVILLE, Y., AND SOLNON, C. 2010. Solving subgraph isomorphism problems with constraint programming. Constraints 15, 3, 327-353.
75. ZHANG, S., LI, S., AND YANG, J. 2009. Gaddi: Distance index based subgraph matching in biological networks. In Proceedings of the 12th International Conference on Extending Database Technology. ACM, New York, 192-203.
76. ZHAO, P., YU, J. X., AND YU, P. S. 2007. Graph indexing: tree + delta >= graph. In Proceedings of the 33rd international Conference on Very Large Databases. ACM, New York, 938-949.
77. ZOBEL, J., MOFFAT, A., AND RAMAMOHANARAO, K. 1998. Inverted files versus signature files for text indexing. ACM Trans. Datab. Syst. 23, 4, 453-490.
78. ZOU, L., CHEN, L., ZHANG, H., LU, Y., AND LOU, Q. 2008. Summarization graph indexing: Beyond frequent structure-based approach. In Database Systems for Advanced Applications. IEEE, Los Alamitos, CA. 141-155.