Abstract
We consider a generalization of the maximum subsequence problem. Given an array a 1,...,a n of real numbers, the generalized problem consists in finding an interval [i,j] such that the length and the sum of the subsequence a i ,...,a j maximize a given quasiconvex function f. Problems of this type occur, e.g., in bioinformatics. We show that the generalized problem can be solved in time O(n log n). As an example, we show how the so-called multiresolution criteria problem can be solved in time O(n log n).
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.
Similar content being viewed by others
References
Allison, L.: Longest biased interval and longest non-negative sum interval. Bioinformatics 19(10), 1294–1295 (2003)
Bentley, J.: Programming Pearls. Addison-Wesley, Reading (1984)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Chen, K.-Y., Chao, K.-M.: On the Range Maximum-Sum Segment Query Problem. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 294–305. Springer, Heidelberg (2004)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry – Algorithms and Applications, 2nd edn. Springer, Heidelberg (2000)
Davies, P.L., Kovac, A.: Local Extremes, Runs, Strings and Multiresolution (with discussion). Annals of Statistics 29, 1–65 (2001)
Fan, T.-H., Lee, S., Lu, H.-I., Tsou, T.S., Wang, T.-C., Yao, A.: An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol. 2759, pp. 251–257. Springer, Heidelberg (2003)
Lin, Y.-L., Jiang, T., Chao, K.-M.: Efficient algorithms for locating the length-constrained heaviest segments, with applications to biomolecular sequence analysis. Journal of Computer and System Sciences 65, 570–586 (2002)
Lipson, D., Aumann, Y., Ben-Dor, A., Linial, N., Yakhini, Z.: Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3500, pp. 83–100. Springer, Heidelberg (2005)
Mulmuley, K.: Computational geometry: An introduction through randomized algorithms. Prentice-Hall, Englewood Cliffs (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bernholt, T., Hofmeister, T. (2006). An Algorithm for a Generalized Maximum Subsequence Problem. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_20
Download citation
DOI: https://doi.org/10.1007/11682462_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)