A data structure for the maximum-sum segment problem with offsets

DOI10.4230/LIPICS.CPM.2024.26MaRDI QIDQ6891068zbMATH OpenFDO

Authors Yoshifumi Sakai

Publication date 2 December 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2024.26

zbMATH Keywords

algorithmsmaximum-sum segmentsequence of real numbers

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• An Optimal Algorithm for the Maximum-Density Segment Problem
• Data Mining with optimized two-dimensional association rules
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• Finding maximum sum segments in sequences with uncertainty
• scientific article; zbMATH DE number 1945161 (Why is no real title available?)
• Linear-time algorithm for finding a maximum-density segment of a sequence
• On the range maximum-sum segment query problem
• Optimal algorithms for the average-constrained maximum-sum segment problem

This page was built for publication: A data structure for the maximum-sum segment problem with offsets

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