Longest common rollercoasters

DOI10.1007/978-3-030-86692-1_3OpenAlexW3202331468MaRDI QIDQ2146120

Kosuke Fujita, Hideo Bannai, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda

Publication date: 15 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86692-1_3

zbMATH Keywords

dynamic programming\(k\)-rollercoasterdynamic range query

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Related Items (3)

Computing longest (common) Lyndon subsequences ⋮ Computing longest Lyndon subsequences and longest common Lyndon subsequences ⋮ Longest bordered and periodic subsequences

Cites Work

• Unnamed Item
• Faster algorithms for computing longest common increasing subsequences
• A fast algorithm for computing a longest common increasing subsequence
• Semi-local string comparison: algorithmic techniques and applications
• Efficient algorithms for finding a longest common increasing subsequence
• On finding a longest common palindromic subsequence
• Fast and longest rollercoasters
• Longest property-preserved common factor: a new string-processing framework
• A hardness result and new algorithm for the longest common palindromic subsequence problem
• Computing a Longest Common Palindromic Subsequence
• Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• 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.
• A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
• Longest property-preserved common factor

This page was built for publication: Longest common rollercoasters