Fast algorithms for finding disjoint subsequences with extremal densities

DOI10.1016/J.PATCOG.2006.01.008zbMATH Open1106.68396OpenAlexW2117142730MaRDI QIDQ850123FDOQ850123

Authors: 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

Recommendations

• Algorithms and Computation
• Fast algorithms for the density finding problem
• scientific article; zbMATH DE number 1945161
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• An Optimal Algorithm for the Maximum-Density Segment Problem

zbMATH Keywords

dynamic programmingprotein structure predictiontime complexityselection algorithmsholes in dataprotein torsion anglerange prediction

Mathematics Subject Classification ID

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

Cites Work

• Sparse dynamic programming I
• Algorithms and Data Structures
• Title not available (Why is that?)
• A note on finding a maximum empty rectangle
• Computing the Largest Empty Rectangle
• A new algorithm for the largest empty rectangle problem
• Dynamic programming with convexity, concavity and sparsity
• Prokaryote clustering based on DNA curvature distributions
• Mining for empty spaces in large data sets.
• Title not available (Why is that?)
• Progress in selection
• Computational Science – ICCS 2005
• Algorithms and Computation
• Algorithms and Computation

Cited In (4)

• Algorithms and Computation
• Approximating the maximum consecutive subsums of a sequence
• On locating disjoint segments with maximum sum of densities
• Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences

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

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