A largest common d-dimensional subsequence of two d-dimensional strings

Authors:
Abdullah N. Arslan
Affiliations:
Department of Computer Science, University of Vermont, Burlington, VT
Venue:
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Year:
2007

Citing 8
Cited 1

Efficient two-dimensional pattern matching in the presence of errors

Information Sciences: an International Journal
The String-to-String Correction Problem

Journal of the ACM (JACM)
Shape matching using edit-distance: an implementation

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Similarity in Two-Dimensional Strings

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Fast Multi-dimensional Approximate Pattern Matching

CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
A Survey of Longest Common Subsequence Algorithms

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Two-dimensional object recognition through two-stage string matching

IEEE Transactions on Image Processing

Pattern discovery in annotated dialogues using dynamic programming

International Journal of Intelligent Information and Database Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a definition for a largest common d-dimensional subsequence of two d-dimensional strings for d ≥ 1. Our purpose is to generalize the well-known definition of a longest common subsequence of linear strings for dimensions higher than one. We prove that computing a largest common two-dimensional subsequence of two given twodimensional strings is NP-complete. We present an algorithm for the case of the problem when the definition is weakened.