Generalized LCS

  • Authors:

  • Amihood Amir;Tzvika Hartman;Oren Kapah;B. Riva Shalom;Dekel Tsur

  • Affiliations:

  • Department of Computer Science, Bar-Ilan University, Ramat-Gan 52900, Israel and Department of Computer Science, Johns Hopkins University, Baltimore, MD 21218, United States;Department of Computer Science, Bar-Ilan University, Ramat-Gan 52900, Israel and The Caesaria Rothschild Foundation, Institute for Interdisciplinary Applications of Computer Science, Haifa Univers ...;Department of Computer Science, Bar-Ilan University, Ramat-Gan 52900, Israel;Department of Computer Science, Bar-Ilan University, Ramat-Gan 52900, Israel;Department of Computer Science, Ben-Gurion University, Beer Sheva 84105, Israel

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 5.23

Visualization

Abstract

The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to devise a similar measure for comparing higher dimensional objects, and more complex structures. In this paper we study the Longest Common Substructure of two matrices and show that this problem is NP-hard. We also study the Longest Common Subforest problem for multiple trees including a constrained version, as well. We show NP-hardness for k2 unordered trees in the constrained LCS. We also give polynomial time algorithms for ordered trees and prove a lower bound for any decomposition strategy for k trees.