Longest bordered and periodic subsequences

DOI10.1016/j.ipl.2023.106398OpenAlexW4364361310MaRDI QIDQ6161459

Tomohiro I., Hideo Bannai, Dominik Köppl

Publication date: 5 June 2023

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

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

zbMATH Keywords

computational complexitydynamic programmingperiodicitydesign of algorithmssubsequences

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semi-local string comparison: algorithmic techniques and applications
• A fast and practical bit-vector algorithm for the longest common subsequence problem
• Fast and longest rollercoasters
• Longest common rollercoasters
• Computing longest (common) Lyndon subsequences
• Maximal common subsequence algorithms
• Subsequence automata with default transitions
• A hardness result and new algorithm for the longest common palindromic subsequence problem
• Searching subsequences
• Longest common subsequence in sublinear space
• Absent subsequences in words
• Longest Increasing and Decreasing Subsequences
• A linear space algorithm for computing maximal common subsequences
• Algorithms for the Longest Common Subsequence Problem
• Rollercoasters and Caterpillars
• Rollercoasters: Long Sequences without Short Runs
• String Processing and Information Retrieval
• Computing a Longest Common Palindromic Subsequence
• A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem.
• Dynamic String Alignment.
• A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem

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