Computing longest (common) Lyndon subsequences
From MaRDI portal
Publication:2169947
DOI10.1007/978-3-031-06678-8_10OpenAlexW4285255549MaRDI QIDQ2169947
Dominik Köppl, Hideo Bannai, Tomasz Kociumaka, Simon J. Puglisi, Tomohiro I.
Publication date: 30 August 2022
Full work available at URL: https://arxiv.org/abs/2201.06773
Related Items (2)
Computing longest Lyndon subsequences and longest common Lyndon subsequences ⋮ Longest bordered and periodic subsequences
Cites Work
- Unnamed Item
- Unnamed Item
- Faster algorithms for computing longest common increasing subsequences
- The longest almost-increasing subsequence
- The longest commonly positioned increasing subsequences problem
- Fast and longest rollercoasters
- Longest common rollercoasters
- Computing a longest common almost-increasing subsequence of two sequences
- Counting Lyndon factors
- A hardness result and new algorithm for the longest common palindromic subsequence problem
- Permutations, matrices, and generalized Young tableaux
- Longest common subsequence in sublinear space
- Absent subsequences in words
- Longest Increasing and Decreasing Subsequences
- Factorizing words over an ordered alphabet
- Algorithms for the Longest Common Subsequence Problem
- The String-to-String Correction Problem
- Rollercoasters: Long Sequences without Short Runs
- Dynamic LCA Queries on Trees
- The “Runs” Theorem
- String Processing and Information Retrieval
- Computing a Longest Common Palindromic Subsequence
- Lowest common ancestors in trees and directed acyclic graphs
- On the Representations of the Symmetric Group
- On Burnside's Problem
- Free differential calculus. IV: The quotient groups of the lower central series
This page was built for publication: Computing longest (common) Lyndon subsequences
