Fast algorithms for finding disjoint subsequences with extremal densities
From MaRDI portal
Publication:850123
DOI10.1016/j.patcog.2006.01.008zbMath1106.68396MaRDI QIDQ850123
Anders Bergkvist, Peter Damaschke
Publication date: 15 November 2006
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2006.01.008
dynamic programming; time complexity; protein structure prediction; selection algorithms; holes in data; protein torsion angle; range prediction
Related Items
On locating disjoint segments with maximum sum of densities, Approximating the maximum consecutive subsums of a sequence
Cites Work
- Unnamed Item
- Unnamed Item
- A new algorithm for the largest empty rectangle problem
- Prokaryote clustering based on DNA curvature distributions
- A note on finding a maximum empty rectangle
- Dynamic programming with convexity, concavity and sparsity
- Mining for empty spaces in large data sets.
- Computing the Largest Empty Rectangle
- Sparse dynamic programming I
- Progress in selection
- Algorithms and Data Structures
- Computational Science – ICCS 2005
- Algorithms and Computation
- Algorithms and Computation