@inproceedings{d4678f809f98497e959783e0934a523b,
title = "Generalized LCS",
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 give, what is to our knowledge, the first inherently multi-dimensional definition of LCS. We discuss the Longest Common Substructure of two matrices and the Longest Common Subtree problem for multiple trees including a constrained version. Both problems cannot be solved by a natural extension of the original LCS solution. We investigate the tractability of the above problems. For the first we prove NP-Conipleteness. For the latter NP-hardness holds for two general unordered trees and for k trees in the constrained LCS.",
author = "Amihood Amir and Tzvika Hartman and Oren Kapah and Shalom, \{B. Riva\} and Dekel Tsur",
note = "Funding Information: The authors wish to thank the anonymous referees for their helpful comments. The first author was partly supported by ISF grant 35/05.; 14th International Symposium on String Processing and Information Retrieval, SPIRE 2007 ; Conference date: 29-10-2007 Through 31-10-2007",
year = "2007",
month = jan,
day = "1",
doi = "10.1007/978-3-540-75530-2\_5",
language = "English",
isbn = "9783540755296",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "50--61",
booktitle = "String Processing and Information Retrieval - 14th International Symposium, SPIRE 2007, Proceedings",
address = "Germany",
}