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