A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings

DOI10.1007/978-3-540-74240-1_5MaRDI QIDQ5444946zbMATH OpenOpenAlexFDO

Authors Abdullah N. Arslan

Publication date 26 February 2008

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74240-1_5

zbMATH Keywords

common subsequencedynamic programmingimagemulti-dimensional stringNP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05)

Recommendations

• The generalized definitions of the two-dimensional largest common substructure problems
• Generalized LCS
• Maximal common subsequences and minimal common supersequences
• A large neighborhood search heuristic for the longest common subsequence problem
• Maximal common subsequence algorithms

Cited in

(1)

• The generalized definitions of the two-dimensional largest common substructure problems

This page was built for publication: A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5444946)