Fast algorithms for finding disjoint subsequences with extremal densities
type: Item
instance of: scholarly article
title: Fast algorithms for finding disjoint subsequences with extremal densities
zbMATH Open document ID: 1106.68396
author: Anders Bergkvist
author: Peter Damaschke
published in: Pattern Recognition
publication date: 2006-11-15T00:00:00Z
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5072635
zbMATH Keywords: holes in data
zbMATH Keywords: range prediction
zbMATH Keywords: protein torsion angle
zbMATH Keywords: protein structure prediction
zbMATH Keywords: dynamic programming
zbMATH Keywords: selection algorithms
zbMATH Keywords: time complexity
MaRDI profile type: Publication
full work available at URL: j.patcog.2006.01.008
OpenAlex ID: W2117142730
cites work: Q3046486
cites work: Computational Science – ICCS 2005
cites work: A note on finding a maximum empty rectangle
cites work: Computing the Largest Empty Rectangle
cites work: Mining for empty spaces in large data sets.
cites work: A new algorithm for the largest empty rectangle problem
cites work: Prokaryote clustering based on DNA curvature distributions
cites work: Algorithms and Computation
cites work: Sparse dynamic programming I
cites work: Dynamic programming with convexity, concavity and sparsity
cites work: Q4418649
cites work: Progress in selection
cites work: Algorithms and Data Structures
DOI: 10.1016/J.PATCOG.2006.01.008
description: scientific article; zbMATH DE number 5072635