Fast algorithms for finding disjoint subsequences with extremal densities

DOI10.1016/j.patcog.2006.01.008zbMath1106.68396OpenAlexW2117142730MaRDI 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

zbMATH Keywords

dynamic programmingtime complexityprotein structure predictionselection algorithmsholes in dataprotein torsion anglerange prediction

Mathematics Subject Classification ID

Dynamic programming (90C39) Pattern recognition, speech recognition (68T10)

Related Items (2)

Approximating the maximum consecutive subsums of a sequence ⋮ On locating disjoint segments with maximum sum of densities

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

This page was built for publication: Fast algorithms for finding disjoint subsequences with extremal densities