Algorithms for problems on maximum density segment

DOI10.1007/978-3-319-29221-2_2MaRDI QIDQ2795931zbMATH OpenOpenAlexFDO

Authors Md. Shafiul Alam, Asish Mukhopadhyay

Publication date 23 March 2016

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-29221-2_2

zbMATH Keywords

computational geometrydata structureslope selectionbiomolecular sequence analysismaximum density segment

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms on strings (68W32)

Recommendations

• An optimal algorithm for the maximum-density segment problem
• On locating disjoint segments with maximum sum of densities
• On Locating Disjoint Segments with Maximum Sum of Densities
• Computational Science – ICCS 2005
• An Optimal Algorithm for the Maximum-Density Segment Problem

Cites work

• scientific article; zbMATH DE number 1303586 (Why is no real title available?)
• scientific article; zbMATH DE number 1945161 (Why is no real title available?)
• An Optimal Algorithm for the Maximum-Density Segment Problem
• An optimal algorithm for selection in a min-heap
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• Fast algorithms for the density finding problem
• Linear-time algorithm for finding a maximum-density segment of a sequence
• Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
• Maintenance of configurations in the plane
• Time bounds for selection

Cited in

(10)

• Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis
• Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
• scientific article; zbMATH DE number 4045753 (Why is no real title available?)
• Computational Science – ICCS 2005
• Optimal randomized algorithm for the density selection problem
• On Locating Disjoint Segments with Maximum Sum of Densities
• Calculating a linear-time solution to the densest-segment problem
• Left-bottom and right-top segments
• On locating disjoint segments with maximum sum of densities
• Optimal algorithms for the average-constrained maximum-sum segment problem

This page was built for publication: Algorithms for problems on maximum density segment

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