Algorithms for Problems on Maximum Density Segment

DOI10.1007/978-3-319-29221-2_2zbMath1434.68741OpenAlexW2398302544MaRDI QIDQ2795931

Md. Shafiul Alam, Asish Kumar 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 geometryslope selectiondata structurebiomolecular sequence analysismaximum density segment

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Linear-time algorithm for finding a maximum-density segment of a sequence
• Fast algorithms for the density finding problem
• Maintenance of configurations in the plane
• Time bounds for selection
• 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.
• An optimal algorithm for selection in a min-heap
• An Optimal Algorithm for the Maximum-Density Segment Problem

This page was built for publication: Algorithms for Problems on Maximum Density Segment