Improved algorithms for the k maximum-sums problems

Theoretical Computer Science

Volumn 362, Issue 1-3, 2006, Pages 162-170

  Cheng, Chih Huai ^a   Chen, Kuan Yu ^a   Tien, Wen Chin ^a   Chao, Kun Mao ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Maximum sum subarray; Maximum sum subsequence; Sequence analysis

Indexed keywords

ALGORITHMS; FUNCTION EVALUATION; NUMBER THEORY; OPTIMAL SYSTEMS;

MAXIMUM SUM SUBARRAY; MAXIMUM SUM SUBSEQUENCE; OPTIMAL ALGORITHMS; SEQUENCE ANALYSIS;

PROBLEM SOLVING;

EID: 33748541951     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.06.007     Document Type: Article

References (21)

1. Allison L. Longest biased interval and longest non-negative sum interval. Bioinformatics 19 (2003) 1294-1295
2. S.E. Bae, T. Takaoka, Algorithms for the Problem of k Maximum Sums and a VLSI Algorithm for the k Maximum Subarrays Problem, in: Proc. Seventh Internat. Symp. Parallel Architectures, Algorithms and Networks, 2004, pp. 247-253.
3. Bae S.E., and Takaoka T. Improved Algorithms for the K-Maximum Subarray Problem for Small K. Proc. 11th Annual Internat. Computing and Combinatorics Conference (2005) 621-631
4. F. Bengtsson, J. Chen, Efficient algorithms for k maximum sums, in: Proc. 15th Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 3341, 2004, pp. 137-148.
5. Bentley J. Programming pearls: algorithm design techniques. Commun. ACM (1984) 865-871
6. Bentley J. Programming pearls: perspective on performance. Commun. ACM (1984) 1087-1092
7. K.-Y. Chen, K.-M Chao, On the range maximum-sum segment query problem, in: Proc. 15th Internat. Symp. Algorithms and Computation, Lecture Notes in Computer Science, Vol. 3341, 2004, pp. 294-305.
8. Chen K.-Y., and Chao K.-M. Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint. Inform. Process. Lett. 96 (2005) 197-201
9. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, second ed., The MIT Press, Cambridge, 1999, pp. 185-196.
10. T.-H. Fan, S. Lee, H.-I. Lu, T.-S. Tsou, T.-C. Wang, A. Yao, An optimal algorithm for maximum-sum segment and its application in bioinformatics, in: Proc. Eighth Internat. Conf. on Implementation and Application of Automata, Lecture Notes in Computer Science, Vol. 2759, 2003, pp. 251-257.
11. Fukuda T., Morimoto Y., Morishita S., and Tokuyama T. Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization. Proc. 1996 ACM SIGMOD Internat. Conf. on Management of Data (1996) 13-23
12. Grenander U. Pattern Analysis (1978), Springer, New York
13. Huang X. An algorithm for identifying regions of a DNA sequence that satisfy a content requirement. Comput. Appl. Biosci. 10 (1994) 219-225
14. T.-C. Lin, D.T. Lee, Randomized algorithm for the sum selection problem, in: Proc. 16th Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 3827, 2005, pp. 515-523.
15. Lin Y.-L., Huang X., Jiang T., and Chao K.-M. MAVG: locating non-overlapping maximum average segments in a given sequence. Bioinformatics 19 (2003) 151-152
16. Lin Y.-L., Jiang T., and Chao K.-M. Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. J. Comput. System Sci. 65 (2002) 570-586
17. Perumalla K., and Deo N. Parallel algorithms for maximum subsequence and maximum subarray. Parallel Process. Lett. 5 (1995) 367-373
18. Ruzzo W.L., and Tompa M. A linear time algorithm for finding all maximal scoring subsequences. Proc. Seventh Internat. Conf. on Intelligent Systems for Molecular Biology (1999) 234-241
19. Takaoka T. Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication. Electronic Notes in Theoretical Computer Science Vol. 61 (2002) 1-10
20. Tamaki T., and Tokuyama T. Algorithms for the maximum subarray problem based on matrix multiplication. Proc. Ninth Annu. ACM-SIAM Symp. on Discrete Algorithms (1998) 446-452
21. Wang L., and Xu Y. SEGID: identifying interesting segments in (multiple) sequence alignments. Bioinformatics 19 (2003) 297-298