Algorithms and hardness for the longest common subsequence of three strings and related problems
From MaRDI portal
Publication:6545446
DOI10.1007/978-3-031-43980-3_30MaRDI QIDQ6545446
Publication date: 29 May 2024
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)
Cites Work
- Title not available (Why is that?)
- On space efficient two dimensional range minimum data structures
- A new efficient algorithm for computing the longest common subsequence
- Semi-local string comparison: algorithmic techniques and applications
- A longest common subsequence algorithm suitable for similar text strings
- Preserving order in a forest in less than logarithmic time and linear space
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Computing the longest common almost-increasing subsequence
- On Cartesian Trees and Range Minimum Queries
- The Complexity of Some Problems on Subsequences and Supersequences
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- String Processing and Information Retrieval
- Longest Square Subsequence Problem Revisited
This page was built for publication: Algorithms and hardness for the longest common subsequence of three strings and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545446)
