Computing longest Lyndon subsequences and longest common Lyndon subsequences
From MaRDI portal
Publication:6119829
DOI10.1007/s00453-023-01125-zOpenAlexW4381835614MaRDI QIDQ6119829
Hideo Bannai, Simon J. Puglisi, Dominik Köppl, Tomasz Kociumaka, Tomohiro I.
Publication date: 25 March 2024
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-023-01125-z
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New algorithms on wavelet trees and applications to information retrieval
- Faster algorithms for computing longest common increasing subsequences
- The longest almost-increasing subsequence
- The longest commonly positioned increasing subsequences problem
- Longest common rollercoasters
- Computing longest (common) Lyndon subsequences
- 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
- On generalized Lyndon words
- 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
- A fast algorithm for computing longest common subsequences
- 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 Burnside's Problem
- Free differential calculus. IV: The quotient groups of the lower central series
This page was built for publication: Computing longest Lyndon subsequences and longest common Lyndon subsequences
