Fast algorithms for finding disjoint subsequences with extremal densities (Q850123): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3046486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Science – ICCS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finding a maximum empty rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Largest Empty Rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining for empty spaces in large data sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the largest empty rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prokaryote clustering based on DNA curvature distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse dynamic programming I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming with convexity, concavity and sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank

Latest revision as of 22:54, 24 June 2024

scientific article
Language Label Description Also known as
English
Fast algorithms for finding disjoint subsequences with extremal densities
scientific article

    Statements

    Fast algorithms for finding disjoint subsequences with extremal densities (English)
    0 references
    0 references
    0 references
    15 November 2006
    0 references
    0 references
    holes in data
    0 references
    range prediction
    0 references
    protein torsion angle
    0 references
    protein structure prediction
    0 references
    dynamic programming
    0 references
    selection algorithms
    0 references
    time complexity
    0 references
    0 references