Cited By
View all- Huang NRoje D(2021)A New QUBO Objective Function for Solving the Maximum Common Subgraph Isomorphism Problem Via Quantum AnnealingSN Computer Science10.1007/s42979-020-00431-52:3Online publication date: 31-Mar-2021
A genetic approach to the maximum common subgraph problem
Pages 98 - 104
Abstract
Finding the maximum common subgraph of a pair of given graphs is a well-known task in theoretical computer science and with considerable practical applications, for example, in the fields of bioinformatics, medicine, chemistry, electronic design and computer vision. This problem is particularly complex and therefore fast heuristics are required to calculate approximate solutions. This article deals with a simple yet effective genetic algorithm that finds quickly a solution, subject to possible geometric constraints.
References
[1]
Conte D., Foggia P., Vento M. Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs. Journal of Graph Algorithms and Applications 11(1):99--143, 2007.
[2]
Duesbury E., Holliday J.D., Willett P. Maximum Common Subgraph Isomorphism Algorithms. MATCH Communications in Mathematical and in Computer Chemistry 77:213--232, 2017.
[3]
Kriege N., Kurpicz F., Mutzel P. On maximum common subgraph problems in series--parallel graphs. European Journal of Combinatorics 69:79--95, 2018.
[4]
Abu-Khzama F.N., Bonnet E., Sikorac F. On the complexity of various parameterizations of common induced subgraph isomorphism. Theoretical Computer Science 697:69--78, 2017.
[5]
Bahiense L., Manić G., Piva B., de Souza Cid C. The maximum common edge subgraph problem: A polyhedral investigation. Discrete Applied Mathematics 160:2523--2541, 2012.
[6]
Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman & Co., 1979.
[7]
Akutsu T., Tamura T. A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree. Algorithms 6(1):119--135, 2013.
[8]
Vismara P., Valery B. Finding Maximum Common Connected Subgraphs using clique detection or Constraint Satisfaction algorithms. Communications in Computer and Information Science 14:358--368, 2008.
[9]
Pelillo M. Replicator Equations, Maximal Cliques and Graph Isomorphism. Neural Computation 11(8):1933--1955, 1999.
[10]
Chen A., Elhajj A., Gao S., Sarhan A., Afra S., Kassem A., Alhajj R. Approximating the maximum common subgraph isomorphism problem with a weighted graph. Knowledge-Based Systems 85:265--276, 2015.
[11]
Rosati P., Lupascu C.A., Tegolo D. Analysis of low-correlated spatial gene expression patterns: A clustering approach in the mouse brain data hosted in the Allen Brain Atlas. IET Computer Vision 12(7):996--1006, 2018.
[12]
Anzalone A., Fusco G., Isgrò F., Orlandi E., Prevete R., Sciortino G., Tegolo D., Valenti C. A system for the automatic measurement of the nuchal translucency thickness from ultrasound video stream of the foetus. Proceedings of the 26th IEEE International Symposium on Computer-Based Medical Systems, Article number 6627795, Pages 239--244, 2013.
[13]
Sciortino G., Orlandi E., Valenti C., Tegolo D. Wavelet analysis and neural network classifiers to detect mid-sagittal sections for nuchal translucency measurement. Image Analysis and Stereology 35(2):105--115, 2016.
[14]
Bellavia F., Cacioppo A., Lupaşcu C.A., Messina P., Scardina G., Tegolo D., Valenti C. A non-parametric segmentation methodology for oral videocapillaroscopic images. Computer Methods and Programs in Biomedicine 114(3):240--246, 2014.
[15]
Sciortino G., Tegolo D., Valenti C. Automatic detection and measurement of nuchal translucency. Computers in Biology and Medicine 82:12--20, 2017.
[16]
Jayaraj P.B., Rahamathulla K., Gopakumar G. A GPU based maximum common subgraph algorithm for drug discovery applications. Proceedings of the 30th International Parallel and Distributed Processing Symposium, 580--588, 2016.
[17]
Droschinsky A., Kriege N., Mutzel P. Finding Largest Common Substructures of Molecules in Quadratic Time. Lecture Notes in Computer Science 10139:309--321, 2017.
[18]
Duesbury E., Holliday J.D., Willett P. Comparison of Maximum Common Subgraph Isomorphism Algorithms for the Alignment of 2D Chemical Structures. ChemMedChem 13(6):588--598, 2018.
[19]
Arca S., Campadelli P., Lanzarotti R., Lipori G., Cervelli F., Mattei A. Improving automatic face recognition with user interaction. Journal of Forensic Sciences 57(3):765--771, 2012.
[20]
Hati A., Chaudhuri S., Velmurugan R. Image Co-segmentation Using Maximum Common Subgraph Matching and Region Co-growing. Lecture Notes in Computer Science 9910:736--752, 2016.
[21]
Guastella D., Valenti C. Cartoon filter via adaptive abstraction. Journal of Visual Communication and Image Representation, Volume 36, pp. 149--158, 2016.
[22]
Grossi G., Lanzarotti R., Lin J. Robust Face Recognition Providing the Identity and Its Reliability Degree Combining Sparse Representation and Multiple Features. International Journal of Pattern Recognition and Artificial Intelligence 30(10):1--18, 2016.
[23]
Kursawe J., Bardenet R., Zartman J.J., Baker R.E., Fletcher A.G. Robust cell tracking in epithelial tissues through identification of maximum common subgraphs. Journal of the Royal Society Interface 13(124):1--13, 2016.
[24]
Hamad H., Tegolo D., Valenti C. Automatic detection and classification of retinal vascular landmarks. Image Analysis and Stereology 33(3):189--200, 2014.
[25]
Gentile V., Sorce S., Malizia A., Pirrello D., Gentile A. Touchless interfaces for public displays: Can we deliver interface designers from introducing artificial push button gestures? Proceedings of the Workshop on Advanced Visual Interfaces, 40--43, 2016.
[26]
Sorce S., Augello A., Santangelo A., Pilato G., Gentile A., Genco A., Gaglio S. A multimodal guide for the augmented campus. Proceedings of ACM SIGUCCS User Services Conference 2007, Pages 325--331, 2007.
[27]
Lupaşcu C.A., Tegolo D., Bellavia F., Valenti C. Semi-automatic registration of retinal images based on line matching approach. Proceedings of the IEEE Symposium on Computer-Based Medical Systems, Article number 6627839, Pages 453--456, 2013. ISSN: 10637125
[28]
Stefano A., Vitabile S., Russo G., Ippolito M., Marletta F., D'Arrigo C., D'Urso D., Gambino O., Pirrone R., Ardizzone E., Gilardi M.C. A fully automatic method for biological target volume segmentation of brain metastases. International Journal of Imaging Systems and Technology 26(1):29--37, 2016.
[29]
Brocchi S., Frosini A., Pinzani R., Rinaldi S. A tiling system for the class of L-convex polyominoes. Theoretical Computer Science 475:73--81, 2013.
[30]
Dulio P., Frosini A., Pagani S.M.C. A geometrical characterization of regions of uniqueness and applications to discrete tomography. Inverse Problems 31(12), Article number 125011, 2015.
[31]
Rong H., Ma T., Tang M., Cao J. A novel subgraph K+-isomorphism method in social network based on graph similarity detection. Soft Computing 22(8):2583--2601, 2018.
[32]
Alfano M., Lenzitti B., Lo Bosco G., Taibi D. A framework for opening data and creating advanced services in the health and social fields. Proceeding of the 17th International Conference on Computer Systems and Technologies 1164:57-64, 2016.
[33]
Engel G., Greiner T., Seifert S. Semantic subgraph isomorphism for enabling physical adaptability of Cyber-physical production systems. Proceedings of the of the 21th IEEE International Conference on Emerging Technologies and Factory Automation, Article number 7733741, 2016.
[34]
Guastella D., Valenti C. Estimating Missing Information by Cluster Analysis and Normalized Convolution. Proceedings of the 4th IEEE International Forum on Research and Technologies for Society and Industry, Article number 8548454, 2018.
[35]
Zhang Z., Wang L., Xie X., Pan H. A Graph Based Document Retrieval Method. Proceedings of the 22nd International Conference on Computer Supported Cooperative Work in Design, IEEE 660--665, 2018.
[36]
Alfano M., Lenzitti B., Lo Bosco G., Perticone V. An automatic system for helping health consumers to understand medical texts. Proceedings of the 8th International Conference on Health Informatics, 622-627, 2015.
[37]
Holland J.H. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. Bradford Books. 1992.
[38]
Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Professional. 1989.
[39]
Mitchell M. An Introduction to Genetic Algorithms. Bradford Books. 1996.
[40]
Michalewicz Z. How to Solve It: Modern Heuristics. Springer. 2004.
[41]
Simon D. Evolutionary Optimization Algorithms. Wiley. 2013.
[42]
Oliver I.M., Smith D.J., Holland J.R.C. A Study of Permutation Crossover Operators on the Traveling Salesman Problem. Proceedings of the 2nd International Conference on Genetic Algorithms, 224--230, 1987.
[43]
Davis L. Applying Adaptive Algorithms to Epistatic Domains. Proceedings of the International Joint Conference on Artificial Intelligence, 162--164, 1985.
[44]
Goldberg D., Lingle R. Alleles, Loci and the TSP. Proceedings of the 1st International Conference on Genetic Algorithms, 154--159, 1985.
[45]
Syswerda G. Schedule optimization using genetic algorithms. Handbook of Genetic Algorithms, 332--349, 1991.
[46]
Tao G., Michalewicz Z. Inver-over operator for the TSP. Parallel Problem Solving from Nature V, 803--812, 1998.
[47]
Merkus H.G. Particle Size Measurements: Fundamentals, Practice, Quality. Springer. 2009.
[48]
Viola P., Jones, M.J. Robust Real-Time Face Detection. International Journal of Computer Vision 57(2):137--154, 2004.
[49]
Conte A., Grossi R., Marino A., Versari L. Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. Proceedings of the 24th International Computing and Combinatorics Conference, pp.328--340, 2018.
Index Terms
- A genetic approach to the maximum common subgraph problem
Recommendations
Approximating the maximum common subgraph isomorphism problem with a weighted graph
The maximum common subgraph isomorphism problem is a difficult graph problem, and the problem of finding the maximum common subgraph isomorphism problem is NP-hard. This means there is likely no algorithm that will be able to find the maximal isomorphic ...
Mean and maximum common subgraph of two graphs
A mean of a pair of graphs, g1 and g2, is formally defined as a graph that minimizes the sum of edit distances to g1 and g2. The edit distance of two graphs g and g' is the minimum cost taken over all sequences of edit operations that transform g into g'...
Maximum common induced subgraph parameterized by vertex cover
The Maximum Common Induced Subgraph problem (MCIS) takes a pair of graphs as input and asks for a graph of maximum order that is isomorphic to an induced subgraph of each of the input graphs. The problem is NP-hard in general, and remains so on many ...
Comments
Information & Contributors
Information
Published In
Copyright © 2019 Owner/Author.
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
In-Cooperation
- UORB: University of Ruse, Bulgaria
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 21 June 2019
Check for updates
Author Tags
Qualifiers
- Abstract
- Research
- Refereed limited
Conference
CompSysTech '19
CompSysTech '19: 20th International Conference on Computer Systems and Technologies
June 21 - 22, 2019
Ruse, Bulgaria
Acceptance Rates
Overall Acceptance Rate 241 of 492 submissions, 49%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 117Total Downloads
- Downloads (Last 12 months)9
- Downloads (Last 6 weeks)1
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
Cited By
View all- Huang NRoje D(2021)A New QUBO Objective Function for Solving the Maximum Common Subgraph Isomorphism Problem Via Quantum AnnealingSN Computer Science10.1007/s42979-020-00431-52:3Online publication date: 31-Mar-2021
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in