Cyclic longest common subsequence

DOI10.1142/S1793830922501038OpenAlexW4224986604MaRDI QIDQ6132857FDOQ6132857

Authors Aaron E. Naiman

Publication date 15 July 2023

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830922501038

zbMATH Keywords

longest common subsequenceefficient algorithmcyclicclustered subsequences

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Longest common subsequence problem for unoriented and cyclic strings
• Longest common subsequences
• Repetition-free longest common subsequence
• Repetition-free longest common subsequence
• Computing longest (common) Lyndon subsequences
• The longest common subsequence problem revisited
• scientific article; zbMATH DE number 6161488
• On the longest common parameterized subsequence
• On the Longest Common Parameterized Subsequence
• Longest common subsequence in sublinear space

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Longest common subsequence problem for unoriented and cyclic strings

This page was built for publication: Cyclic longest common subsequence

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