An optimal algorithm for the maximum-density segment problem
From MaRDI portal
Recommendations
- An Optimal Algorithm for the Maximum-Density Segment Problem
- scientific article; zbMATH DE number 1945161
- scientific article; zbMATH DE number 1929960
- Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
- Fast algorithms for the density finding problem
Cited in
(18)- On locating disjoint segments with maximum sum of densities
- Fast algorithms for the density finding problem
- Algorithms for the optimal identification of segment neighborhoods
- Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
- Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
- Algorithms for problems on maximum density segment
- An optimal algorithm for maximum-sum segment and its application in bioinformatics (extended abstract)
- Optimal randomized algorithm for the density selection problem
- scientific article; zbMATH DE number 1945161 (Why is no real title available?)
- An Optimal Algorithm for the Maximum-Density Segment Problem
- scientific article; zbMATH DE number 1929960 (Why is no real title available?)
- scientific article; zbMATH DE number 7370598 (Why is no real title available?)
- Calculating a linear-time solution to the densest-segment problem
- On Locating Disjoint Segments with Maximum Sum of Densities
- Computational Science – ICCS 2005
- Searching a bitstream in linear time for the longest substring of any given density
- Linear time maximum segmentation problems in column stream model
- Robust Validation: Confident Predictions Even When Distributions Shift
This page was built for publication: An optimal algorithm for the maximum-density segment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897241)
