On locating disjoint segments with maximum sum of densities

DOI10.1007/S00453-007-9122-6zbMATH Open1189.68175OpenAlexW2020758113MaRDI QIDQ1024216FDOQ1024216

Hsiao-Fei Liu, Kun-Mao Chao

Publication date: 16 June 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/232946/-1/01.pdf

Recommendations

• On Locating Disjoint Segments with Maximum Sum of Densities
• Computational Science – ICCS 2005
• Algorithms for problems on maximum density segment
• An optimal algorithm for the maximum-density segment problem
• scientific article; zbMATH DE number 1945161

zbMATH Keywords

sequence analysismaximum-average segmentmaximum-density segment

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Cites Work

• 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.
• A geometric framework for solving subsequence problems in computational biology efficiently
• An Optimal Algorithm for the Maximum-Density Segment Problem
• Mining optimized association rules for numeric attributes
• Computational Science – ICCS 2005
• Fast algorithms for finding disjoint subsequences with extremal densities
• Linear-time algorithm for finding a maximum-density segment of a sequence

Cited In (2)

• Computational Science – ICCS 2005
• On Locating Disjoint Segments with Maximum Sum of Densities

Uses Software

• MAVG

This page was built for publication: On locating disjoint segments with maximum sum of densities

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