Pages that link to "Item:Q2410574"
From MaRDI portal
The following pages link to A hardness result and new algorithm for the longest common palindromic subsequence problem (Q2410574):
Displaying 11 items.
- Longest common rollercoasters (Q2146120) (← links)
- Computing longest (common) Lyndon subsequences (Q2169947) (← links)
- Longest property-preserved common factor: a new string-processing framework (Q2297866) (← links)
- Anytime algorithms for the longest common palindromic subsequence problem (Q2337390) (← links)
- Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444) (← links)
- An efficient algorithm for the longest common palindromic subsequence problem (Q2672607) (← links)
- Faster STR-EC-LCS Computation (Q3297762) (← links)
- (Q5140779) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
- Longest bordered and periodic subsequences (Q6161459) (← links)
- Online algorithms on antipowers and antiperiods (Q6536254) (← links)
