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

DOI10.1016/J.IPL.2008.09.024zbMath1191.68823OpenAlexW2146651544MaRDI QIDQ976064

Hsiao-Fei Liu, Kun-Mao Chao, Chih-Huai Cheng

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw//handle/246246/154578

zbMATH Keywords

algorithmsaverageassociation rulesmaximum-sum segment

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (1)

Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence

Uses Software

• SEGID

Cites Work

• Unnamed Item
• Randomized algorithm for the sum selection problem
• Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
• Pattern analysis. Lectures in pattern theory. Vol. II
• Mining optimized association rules for numeric attributes
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• On the range maximum-sum segment query problem
• Improved algorithms for the \(k\) maximum-sums problems
• Data Mining with optimized two-dimensional association rules
• A Linear Time Algorithm for the k Maximal Sums Problem
• An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics
• Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem
• Algorithms and Computation
• Computing and Combinatorics

This page was built for publication: Optimal algorithms for the average-constrained maximum-sum segment problem