Computing longest Lyndon subsequences and longest common Lyndon subsequences
type: Item
instance of: scholarly article
title: Computing longest Lyndon subsequences and longest common Lyndon subsequences
author: Hideo Bannai
author: Tomohiro I
author: Tomasz Kociumaka
author: Dominik Köppl
author: Simon J. Puglisi
published in: Algorithmica
publication date: 2024-03-25T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7823156
zbMATH Keywords: Lyndon word
zbMATH Keywords: subsequence
zbMATH Keywords: lexicographic order
zbMATH Keywords: dynamic programming
MaRDI profile type: MaRDI publication profile
full work available at URL: s00453-023-01125-z
OpenAlex ID: W4381835614
cites work: Q2754135
cites work: The “Runs” Theorem
cites work: Computing longest (common) Lyndon subsequences
cites work: Lowest common ancestors in trees and directed acyclic graphs
cites work: Rollercoasters: Long Sequences without Short Runs
cites work: Q5417615
cites work: Free differential calculus. IV: The quotient groups of the lower central series
cites work: Computing a Longest Common Palindromic Subsequence
cites work: Dynamic LCA Queries on Trees
cites work: On generalized Lyndon words
cites work: Factorizing words over an ordered alphabet
cites work: The longest almost-increasing subsequence
cites work: Longest common rollercoasters
cites work: New algorithms on wavelet trees and applications to information retrieval
cites work: Q5090479
cites work: Counting Lyndon factors
cites work: Q4471381
cites work: The longest commonly positioned increasing subsequences problem
cites work: Algorithms for the Longest Common Subsequence Problem
cites work: A fast algorithm for computing longest common subsequences
cites work: A hardness result and new algorithm for the longest common palindromic subsequence problem
cites work: Q5140779
cites work: Longest common subsequence in sublinear space
cites work: Permutations, matrices, and generalized Young tableaux
cites work: Absent subsequences in words
cites work: String Processing and Information Retrieval
cites work: Faster algorithms for computing longest common increasing subsequences
cites work: On Burnside's Problem
cites work: Longest Increasing and Decreasing Subsequences
cites work: Computing a longest common almost-increasing subsequence of two sequences
cites work: The String-to-String Correction Problem
DOI: 10.1007/S00453-023-01125-Z
description: scientific article; zbMATH DE number 7823156