Optimal algorithms for the average-constrained maximum-sum segment problem

Authors:
Chih-Huai Cheng;Hsiao-Fei Liu;Kun-Mao Chao
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan 106;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan 106;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan 106 and Graduate Institute of Biomedical Electronics and Bioinformatics, National Taiwan Univ ...
Venue:
Information Processing Letters
Year:
2009

Citing 17
Cited 0

Mining optimized association rules for numeric attributes

Journal of Computer and System Sciences
Programming pearls: perspective on performance

Communications of the ACM
Programming pearls: algorithm design techniques

Communications of the ACM
Data Mining with optimized two-dimensional association rules

ACM Transactions on Database Systems (TODS)
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis

Journal of Computer and System Sciences - Computational biology 2002
A Linear Time Algorithm for Finding All Maximal Scoring Subsequences

Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Improved algorithmms for the k maximum-sums problems

Theoretical Computer Science
Randomized algorithm for the sum selection problem

Theoretical Computer Science
A geometric framework for solving subsequence problems in computational biology efficiently

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
On the range maximum-sum segment query problem

Discrete Applied Mathematics
Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence

Theoretical Computer Science
An optimal algorithm for maximum-sum segment and its application in bioinformatics

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Improved algorithms for the K-maximum subarray problem for small K

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Efficient algorithms for k maximum sums

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Efficient algorithms for the sum selection problem and k maximum sums problem

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A linear time algorithm for the k maximal sums problem

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

Given a real number sequence A=(a"1,a"2,...,a"n), an average lower bound L, and an average upper bound U, the Average-Constrained Maximum-Sum Segment problem is to locate a segment A(i,j)=(a"i,a"i"+"1,...,a"j) that maximizes @?"i"=