Generalized lCS

A. Amihood; T Hartman; O Kapah; B. R Shalom; D Tsur

Generalized lCS

A. Amihood, T Hartman, O Kapah, B. R Shalom, D Tsur

Department of Computer Science

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

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 NPNP-Completeness. For the latter NPNP-hardness holds for two general unordered trees and for k trees in the constrained LCS.

Original language	American English
Title of host publication	International Symposium on String Processing and Information Retrieval
Editors	Nivio Ziviani, Ricardo Baeza-Yates
Publisher	Springer Berlin Heidelberg
State	Published - 2007

Bibliographical note

Place of conference:Santiago, Chile

Cite this

@inproceedings{8b3664381fe4493b9857f6298af9d290,

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 NPNP-Completeness. For the latter NPNP-hardness holds for two general unordered trees and for k trees in the constrained LCS.",

author = "A. Amihood and T Hartman and O Kapah and Shalom, {B. R} and D Tsur",

note = "Place of conference:Santiago, Chile",

year = "2007",

language = "American English",

editor = "Nivio Ziviani and Ricardo Baeza-Yates",

booktitle = "International Symposium on String Processing and Information Retrieval",

publisher = "Springer Berlin Heidelberg",

}

TY - GEN

T1 - Generalized lCS

AU - Amihood, A.

AU - Hartman, T

AU - Kapah, O

AU - Shalom, B. R

AU - Tsur, D

N1 - Place of conference:Santiago, Chile

PY - 2007

Y1 - 2007

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 NPNP-Completeness. For the latter NPNP-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 NPNP-Completeness. For the latter NPNP-hardness holds for two general unordered trees and for k trees in the constrained LCS.

UR - https://scholar.google.co.il/scholar?q=Generalized+LCS+&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - International Symposium on String Processing and Information Retrieval

A2 - Ziviani, Nivio

A2 - Baeza-Yates, Ricardo

PB - Springer Berlin Heidelberg

ER -

Generalized lCS

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this