Longest bordered and periodic subsequences

DOI10.1016/J.IPL.2023.106398MaRDI QIDQ6161459zbMATH OpenOpenAlexFDO

Authors Hideo Bannai, Tomohiro I, Dominik Köppl

Publication date 5 June 2023

Published in Information Processing Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.ipl.2023.106398

zbMATH Keywords

computational complexitydesign of algorithmsdynamic programmingperiodicitysubsequences

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A fast and practical bit-vector algorithm for the longest common subsequence problem
• A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
• A hardness result and new algorithm for the longest common palindromic subsequence problem
• A linear space algorithm for computing maximal common subsequences
• A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem.
• Absent subsequences in words
• Algorithms for the Longest Common Subsequence Problem
• Computing a longest common palindromic subsequence
• Computing longest (common) Lyndon subsequences
• Computing longest common square subsequences
• Dynamic String Alignment.
• Fast and longest rollercoasters
• scientific article; zbMATH DE number 6297698 (Why is no real title available?)
• scientific article; zbMATH DE number 2243390 (Why is no real title available?)
• Introduction to algorithms.
• Longest common rollercoasters
• Longest common subsequence in sublinear space
• Longest Increasing and Decreasing Subsequences
• Longest Square Subsequence Problem Revisited
• Maximal common subsequence algorithms
• Rollercoasters and caterpillars
• Rollercoasters: Long Sequences without Short Runs
• Searching subsequences
• Semi-local string comparison: algorithmic techniques and applications
• String Processing and Information Retrieval
• The longest run subsequence problem

Cited in

(1)

• Fast algorithms for window accumulated subsequence matching problem

This page was built for publication: Longest bordered and periodic subsequences

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