Dynamic programming with convexity, concavity and sparsity (Q1190452): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Applications of generalized matrix searching to geometric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Complexity of the Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest common subsequence problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Treatment of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence comparison with mixed convex and concave costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse dynamic programming I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up dynamic programming with applications to molecular biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for concave one-dimensional dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comprehensive Model of Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear space algorithm for computing maximal common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Least Weight Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Matrix Chain Products. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Matrix Chain Products. Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A priority queue in which initialization and queue operations takeO(loglogD) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-State Processes and Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm with unknown time complexity for convex matrix searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence comparison with concave weighting functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: General context-free recognition in less than cubic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving order in a forest in less than logarithmic time and linear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an efficient dynamic programming technique of F. F. Yao / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: RNA secondary structure: a complete mathematical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid dynamic programming algorithms for RNA secondary structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The concave least-weight subsequence problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Context Dependent Comparison of Biological Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the String Editing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed-Up in Dynamic Programming / rank
 
Normal rank

Latest revision as of 11:44, 16 May 2024

scientific article
Language Label Description Also known as
English
Dynamic programming with convexity, concavity and sparsity
scientific article

    Statements

    Dynamic programming with convexity, concavity and sparsity (English)
    0 references
    0 references
    0 references
    26 September 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    survey
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references