Abstract
Efficient algorithms for finding multiple contiguous subsequences of a real-valued sequence having large cumulative sums, in addition to its combinatorial appeal, have widely varying applications such as in textual information retrieval and bioinformatics. A maximum contiguous subsequence of a real-valued sequence is a contiguous subsequence with the maximum cumulative sum. A minimal maximum contiguous subsequence is a minimal contiguous subsequence (with respect to subsequential containment) among all maximum ones of the sequence. We present a logarithmic-time and optimal linear-work parallel algorithm on the parallel random access machine model that finds all successive minimal maximum subsequences of a real-valued sequence.
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
Akl, S.G., Guenther, G.R.: Applications of broadcasting with selective reduction to the maximal sum subsegment problem. International Journal of High Speed Computing 3(2), 107–119 (1991)
Berkman, O., Breslauer, D., Galil, Z., Schieber, B., Vishkin, U.: Highlyparallelizable problems. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 309–319. Association for Computing Machinery (1989)
Brendel, V., Bucher, P., Nourbakhsh, I.R., Blaisdell, B.E., Karlin, S.: Methods and algorithms for statistical analysis of protein sequences. Proceedings of the National Academy of Sciences U.S.A. 89(6), 2002–2006 (1992)
Chen, D.Z.: Efficient geometric algorithms on the EREW PRAM. IEEE Transactions on Parallel and Distributed Systems 6(1), 41–47 (1995)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)
JáJá, J.: An Introduction to Parallel Algorithms. Addison-Wesley, Reading (1992)
Karlin, S., Altschul, S.F.: Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. Proceedings of the National Academy of Sciences U.S.A. 87(6), 2264–2268 (1990)
Karlin, S., Altschul, S.F.: Applications and statistics for multiple high-scoring segments in molecular sequences. Proceedings of the National Academy of Sciences U.S.A. 90(12), 5873–5877 (1993)
Karlin, S., Brendel, V.: Chance and statistical significance in protein and DNA sequence analysis. Science 257(5066), 39–49 (1992)
Karlin, S., Dembo, A.: Limit distributions of maximal segmental score among Markov-dependent partial sums. Advances in Applied Probability 24, 113–140 (1992)
Ladner, R.E., Fischer, M.J.: Parallel prefix computation. Journal of the Association for Computing Machinery 27(4), 831–838 (1980)
Ruzzo, W.L., Tompa, M.: A linear time algorithm for finding all maximal scoring subsequences. In: Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, pp. 234–241. International Society for Computational Biology (1999)
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
Dai, HK., Su, HC. (2006). A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences. 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_33
Download citation
DOI: https://doi.org/10.1007/11682462_33
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)