Longest common rollercoasters

DOI10.1007/978-3-030-86692-1_3MaRDI QIDQ2146120zbMATH OpenOpenAlexFDO

Authors Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, 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

\(k\)-rollercoasterdynamic programmingdynamic 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)

Recommendations

• Fast and longest rollercoasters
• Fast and longest rollercoasters
• Rollercoasters: Long Sequences without Short Runs
• Longest common extension
• Roller coaster curve singularities
• Rollercoasters and caterpillars
• Devil's staircases, ramps, humps and roller coasters
• The comfortable roller coaster-on the shape of tracks with a constant normal force

Cites work

• A fast algorithm for computing a longest common increasing subsequence
• A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• A hardness result and new algorithm for the longest common palindromic subsequence problem
• A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem.
• Computing a Longest Common Palindromic Subsequence
• Computing a longest common palindromic subsequence
• Computing longest common square subsequences
• Efficient algorithms for finding a longest common increasing subsequence
• Fast and longest rollercoasters
• Faster algorithms for computing longest common increasing subsequences
• Improved bounds for drawing trees on fixed points with L-shaped edges
• Longest property-preserved common factor
• Longest property-preserved common factor: a new string-processing framework
• On finding a longest common palindromic subsequence
• Rollercoasters and caterpillars
• Rollercoasters: Long Sequences without Short Runs
• Semi-local string comparison: algorithmic techniques and applications
• String Processing and Information Retrieval

Cited in

(4)

• Computing longest (common) Lyndon subsequences
• Rollercoasters: Long Sequences without Short Runs
• Computing longest Lyndon subsequences and longest common Lyndon subsequences
• Longest bordered and periodic subsequences

This page was built for publication: Longest common rollercoasters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146120)