Fast computation of a longest increasing subsequence and application
From MaRDI portal
Recommendations
- Faster Algorithms for Computing Longest Common Increasing Subsequences
- Faster algorithms for computing longest common increasing subsequences
- Algorithms and Computation
- Efficient algorithms for finding a longest common increasing subsequence
- On two variants of the longest increasing subsequence problem
Cites work
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 795114 (Why is no real title available?)
- A New Efficient Algorithm for Computing the Longest Common Subsequence
- A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
- A fast algorithm for computing a longest common increasing subsequence
- A fast algorithm for computing longest common subsequences
- A faster algorithm computing string edit distances
- Algorithms on Strings
- Algorithms on Strings, Trees and Sequences
- Data streams: algorithms and applications.
- Design and implementation of an efficient priority queue
- Deterministic sorting in O(nloglogn) time and linear space
- Enumerating longest increasing subsequences and patience sorting
- Finding longest increasing and common subsequences in streaming data
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
- Longest Increasing and Decreasing Subsequences
- On computing the length of longest increasing subsequences
- On the distribution of the length of the longest increasing subsequence of random permutations
- Preserving order in a forest in less than logarithmic time and linear space
Cited in
(30)- Near-optimal algorithm to count occurrences of subsequences of a given length
- Tight conditional lower bounds for longest common increasing subsequence
- scientific article; zbMATH DE number 7559139 (Why is no real title available?)
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- Tight conditional lower bounds for longest common increasing subsequence
- Faster Algorithms for Computing Longest Common Increasing Subsequences
- The longest almost increasing subsequence problem with sliding windows
- The longest almost-increasing subsequence
- Rollercoasters and caterpillars
- Fast and longest rollercoasters
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
- Improvised divide and conquer approach for the LIS problem
- scientific article; zbMATH DE number 3860389 (Why is no real title available?)
- Enumerating longest increasing subsequences and patience sorting
- scientific article; zbMATH DE number 1998299 (Why is no real title available?)
- On-line scheduling with monotone subsequence constraints
- A CGM Algorithm Solving the Longest Increasing Subsequence Problem
- Subsequences in bounded ranges: matching and analysis problems
- Space-efficient algorithms for longest increasing subsequence
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
- Space-efficient algorithms for longest increasing subsequence
- An algorithm for the determination of longest increasing subsequence in a sequence
- A faster reduction of the dynamic time warping distance to the longest increasing subsequence length
- The longest commonly positioned increasing subsequences problem
- On two variants of the longest increasing subsequence problem
- The communication and streaming complexity of computing the longest common and increasing subsequences
- Estimating the longest increasing sequence in polylogarithmic time
- Rollercoasters: Long Sequences without Short Runs
- On the longest upsequence problem for permutations
- A diagonal-based algorithm for the longest common increasing subsequence problem
This page was built for publication: Fast computation of a longest increasing subsequence and application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1959440)
