Maximum common subgraph: some upper bound and lower bound results

Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this process into a problem of finding a maximum common subgraph between graphical representations of these structures. Among the many different variants of the maximum common subgraph problem, the maximum common induced subgraph of two graphs is of special interest. Results: Based on current research in the area of parameterized computation, we derive a new lower bound for the exact algorithms of the maximum common induced subgraph of two graphs which is the best currently known. Then we investigate the upper bound and design techniques for approaching this problem, specifically, reducing it to one of finding a maximum clique in the product graph of the two given graphs. Considering the upper bound result, the derived lower bound result is asymptotically tight. Conclusion: Parameterized computation is a viable app...

• Type: Journal
• Year: 2006
• Where: BMCBI
• Authors: Xiuzhen Huang, Jing Lai, Steven F. Jennings
• Keywords: BMCBI 2006, Common Induced Subgraph, Common Subgraph Problem, Maximum Common Subgraph