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

DOI10.1016/J.IPL.2008.09.024zbMATH Open1191.68823OpenAlexW2146651544MaRDI QIDQ976064FDOQ976064

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

Recommendations

• Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
• Algorithms for problems on maximum density segment
• scientific article; zbMATH DE number 1929960
• Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.

zbMATH Keywords

algorithmsaverageassociation rulesmaximum-sum segment

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Data Mining with optimized two-dimensional association rules
• Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• A geometric framework for solving subsequence problems in computational biology efficiently
• Pattern analysis. Lectures in pattern theory. Vol. II
• Mining optimized association rules for numeric attributes
• A Linear Time Algorithm for the k Maximal Sums Problem
• On the range maximum-sum segment query problem
• An optimal algorithm for maximum-sum segment and its application in bioinformatics (extended abstract)
• Improved algorithms for the \(k\) maximum-sums problems
• Computing and Combinatorics
• Randomized algorithm for the sum selection problem
• Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem
• Algorithms and Computation

Cited In (1)

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

Uses Software

• SEGID

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976064)