An algorithm for solving the longest increasing circular subsequence problem

Keywords

Longest common subsequence problem, Longest increasing subsequence, Algorithm, Subsequence, Computer science

References

• Algorithms on Strings, Trees, and Sequences - Computer Science and Computational BiologyDan Gusfield — 1997
• On the longest increasing subsequence of a circular listMichael Albert, M. D. Atkinson, Doron Nussbaum — 2007
• Longest increasing subsequences in sliding windowsMichael Albert, Alexander Golynski, Angèle M. Hamel — 2004
• Design and implementation of an efficient priority queuePeter Emde Boas, R. Kaas, E.E. Zijlstra — 1976
• Semi-local String Comparison: Algorithmic Techniques and ApplicationsAlexander Tiskin — 2007
• Longest increasing subsequences in windows based on canonical antichain partitionErdong Chen, Linji Yang, Hao Yuan — 2005
• A comparative genome approach to marker orderingT. Faraut, Simon de Givry, Patrick Chabrier — 2007
• Algorithms on strings, trees, and sequencesDan Gusfield — 1997
• Semi-local string comparison : algorithmic techniques and applicationsAlexander Tiskin — 2008

Cited by

• New algorithms for exact and approximate text matchingSzymon Grabowski — 2009
• Sekwencyjne i równolegle algorytmy znajdowania podciągówSebastian Deorowicz — 2010
• Semi-local String Comparison: Algorithmic Techniques and ApplicationsAlexander Tiskin — 2007
• A Cover-Merging-Based Algorithm for the Longest Increasing Subsequence in a Sliding Window ProblemSebastian Deorowicz — 2013
• LIS using backtracking and branch-and-bound approachesSeema Rani, Dharmveer Singh Rajpoot — 2016
• Improvised divide and conquer approach for the LIS problemSeema Rani, Dharmveer Singh Rajpoot — 2018
• On-line scheduling with monotone subsequence constraintsKelin Luo, Yinfeng Xu, Huili Zhang — 2019
• Data Science and Analytics: 5th International Conference on Recent Developments in Science, Engineering and Technology, REDSET 2019, Gurugram, India, November 15–16, 2019, Revised Selected Papers, Part IUsha Batra, Nihar Ranjan Roy, Brajendra Panda — 2020
• The Longest Almost Increasing Subsequence Problem with Sliding WindowsCheng-Han Ho, Chang‐Biau Yang — 2023
• The longest almost increasing subsequence problem with sliding windowsCheng-Han Ho, Chang‐Biau Yang — 2024
• On Two Variants of the Longest Increasing Subsequence ProblemS. Deorowicz, S. Grabowski — 2009
• On-line Scheduling with a Monotonous Subsequence ConstraintKelin Luo, Yinfeng Xu, Huili Zhang — 2017
• Parallel Solution to LIS Using Divide-and-Conquer ApproachS. Rani, D. S. Rajpoot — 2019
• Online Scheduling with Increasing Subsequence Serving ConstraintKelin Luo, Yinfeng Xu, Xin Feng — 2016
• On Some Variants of the Longest Increasing Subsequence ProblemS. Deorowicz — 2010
• Semi-local string comparison : algorithmic techniques and applicationsAlexander Tiskin — 2008

Related papers

• Bit-Parallel Algorithm for the Constrained Longest Common Subsequence ProblemDeorowiczSebastian — 2010
• Longest (Sub-)Periodic SubsequenceHideo Bannai, I Tomohiro, Dominik Köppl — 2022
• A fast algorithm for computing a longest common increasing subsequenceI‐Hsuan Yang, Chien-Pin Huang, Kun‐Mao Chao — 2005
• Computing The Longest Common Almost-Increasing SubsequenceMohammad Tawhidul Hasan Bhuiyan, Muhammad Rashed Alam, M. Sohel Rahman — 2022
• What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other?Elizabeth J. Itskovich, Vadim E. Levit — 2019
• A Fast Randomized Algorithm for Finding the Maximal Common SubsequencesJin Cao, Dewei Zhong — 2020
• Longest Common Increasing Subsequence: An Enumerative SolutionChun‐Yu Lin — 2020