Abstract
Finding a longest increasing subsequence (LIS) of a given sequence is a classic problem in string matching, with applications mostly in computational biology.Recently,many variations of this problem have been introduced.We present new algorithms for two such problems: the longest increasing circular subsequence (LICS) and the slope-constrained longest increasing subsequence (SLIS). For LICS, our algorithm improves one of the most competitive techniques if the length of the output sequence is close to its expected value \(2\sqrt{n}+o(\sqrt{n})\). In the algorithm for SLIS, we show how to gain from modern successor search data structures, which is not trivial for this task.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert, M.H., Atkinson, M.D., Nussbaum, D., Sack, J.R., Santoro, N.: On the longest increasing subsequence of a circular list. Information Processing Letters 101, 55–59 (2007)
Andersson, A., Thorup, M.: Dynamic ordered sets with exponential search trees. Journal of the ACM 54(3), Article No. 13 (2007)
Beame, P., Fich, F.E.: Optimal bounds for the predecessor problem and related problems. Journal of Computer and System Sciences 65(1), 38–72 (2002)
Brass, P.: Advanced Data Structures. Cambridge University Press, Cambridge (2008)
Chen, E., Yang, L., Yuan, H.: Longest increasing subsequences in windows based on canonical antichain partition. Theory of Computer Science 378(3), 223–236 (2007)
Deorowicz, S.: An algorithm for solving the longest increasing circular subsequence problem. Information Processing Letters 109(12), 630–634 (2009)
van Emde Boas, P., Kaas, R., Zijlstra, E.: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters 6(3), 80–82 (1977)
Fredman, M.L.: On computing the length of longest increasing subsequences. Discrete Mathematics 11, 29–35 (1975)
Gusfield, D.: Algorithms on strings, trees, and sequences. Cambridge University Press, Cambridge (1999)
Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest common subsequences. Communications of the ACM 20(5), 350–353 (1977)
Kirkpatrick, D.G., Reisch, G.: Upper bounds for sorting integers on random access machines. Theoretical Computer Science 28, 263–276 (1984)
Tiskin, A.: Semi-local string comparison: Algorithmic techniques and applications. Mathematics in Computer Science 1(4), 571–603 (2008)
Yang, I.H., Chen, Y.C.: Fast algorithms for the constrained longest increasing subsequence problems. In: Proceedings of the 25th Workshop on Combinatorial Mathematics and Computing Theory, pp. 226–231. Hsinchu Hsien, Taiwan (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deorowicz, S., Grabowski, S. (2009). On Two Variants of the Longest Increasing Subsequence Problem. In: Cyran, K.A., Kozielski, S., Peters, J.F., Stańczyk, U., Wakulicz-Deja, A. (eds) Man-Machine Interactions. Advances in Intelligent and Soft Computing, vol 59. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00563-3_57
Download citation
DOI: https://doi.org/10.1007/978-3-642-00563-3_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00562-6
Online ISBN: 978-3-642-00563-3
eBook Packages: EngineeringEngineering (R0)