The Generalized Definitions of the Two-Dimensional Largest Common Substructure Problems

The similarity of two one-dimensional sequences is usually measured by the longest common subsequence (LCS) algorithms. However, these algorithms cannot be directly extended to solve the two or higher dimensional data. Thus, for the two-dimensional data, computing the similarity with an LCS-like app...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica 2020-07, Vol.82 (7), p.2039-2062
Hauptverfasser:	Chan, Huang-Ting, Chiu, Hsuan-Tsung, Yang, Chang-Biau, Peng, Yung-Hsing
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Matching Mathematics of Computing Similarity Substructures Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!