On locating disjoint segments with maximum sum of densities
From MaRDI portal
Publication:1024216
DOI10.1007/s00453-007-9122-6zbMath1189.68175MaRDI QIDQ1024216
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
Uses Software
Cites Work
- Unnamed Item
- Fast algorithms for finding disjoint subsequences with extremal densities
- Linear-time algorithm for finding a maximum-density segment of a sequence
- Mining optimized association rules for numeric attributes
- 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 the Maximum-Density Segment Problem
- Computational Science – ICCS 2005