Generalized LCS

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

doi:10.1007/978-3-540-75530-2_5

Generalized LCS

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

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

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.

Original language	English
Title of host publication	String Processing and Information Retrieval - 14th International Symposium, SPIRE 2007, Proceedings
Publisher	Springer Verlag
Pages	50-61
Number of pages	12
ISBN (Print)	9783540755296
DOIs	https://doi.org/10.1007/978-3-540-75530-2_5
State	Published - 1 Jan 2007
Event	14th International Symposium on String Processing and Information Retrieval, SPIRE 2007 - Santiago, Chile Duration: 29 Oct 2007 → 31 Oct 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4726 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	14th International Symposium on String Processing and Information Retrieval, SPIRE 2007
Country/Territory	Chile
City	Santiago
Period	29/10/07 → 31/10/07

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-75530-2_5

Cite this

Amir, A., Hartman, T., Kapah, O., Shalom, B. R., & Tsur, D. (2007). Generalized LCS. In String Processing and Information Retrieval - 14th International Symposium, SPIRE 2007, Proceedings (pp. 50-61). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4726 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-75530-2_5

@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",

}

Amir, A, Hartman, T, Kapah, O, Shalom, BR & Tsur, D 2007, Generalized LCS. in String Processing and Information Retrieval - 14th International Symposium, SPIRE 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4726 LNCS, Springer Verlag, pp. 50-61, 14th International Symposium on String Processing and Information Retrieval, SPIRE 2007, Santiago, Chile, 29/10/07. https://doi.org/10.1007/978-3-540-75530-2_5

Generalized LCS. / Amir, Amihood; Hartman, Tzvika; Kapah, Oren et al.
String Processing and Information Retrieval - 14th International Symposium, SPIRE 2007, Proceedings. Springer Verlag, 2007. p. 50-61 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4726 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Generalized LCS

AU - Amir, Amihood

AU - Hartman, Tzvika

AU - Kapah, Oren

AU - Shalom, B. Riva

AU - Tsur, Dekel

N1 - 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.

PY - 2007/1/1

Y1 - 2007/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38049013942&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-75530-2_5

DO - 10.1007/978-3-540-75530-2_5

M3 - Conference contribution

AN - SCOPUS:38049013942

SN - 9783540755296

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 50

EP - 61

BT - String Processing and Information Retrieval - 14th International Symposium, SPIRE 2007, Proceedings

PB - Springer Verlag

T2 - 14th International Symposium on String Processing and Information Retrieval, SPIRE 2007

Y2 - 29 October 2007 through 31 October 2007

ER -

Generalized LCS

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this