Longest increasing subsequences in windows based on canonical antichain partition
From MaRDI portal
Publication:2371801
DOI10.1016/j.tcs.2007.02.032zbMath1115.68160OpenAlexW2116226084MaRDI QIDQ2371801
Hao Yuan, Linji Yang, Erdong Chen
Publication date: 9 July 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.032
Related Items
Improvised divide and conquer approach for the LIS problem ⋮ An algorithm for solving the longest increasing circular subsequence problem
Cites Work
- Enumerating longest increasing subsequences and patience sorting
- Comparison of biosequences
- Erratum to: New clique and independent set algorithms for circle graphs
- On computing the length of longest increasing subsequences
- Preserving order in a forest in less than logarithmic time and linear space
- Longest increasing subsequences in sliding windows
- Finding longest increasing and common subsequences in streaming data
- Longest Increasing and Decreasing Subsequences
- Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms