DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM (Q4532713)

From MaRDI portal
Revision as of 02:27, 31 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1750068
Language Label Description Also known as
English
DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
scientific article; zbMATH DE number 1750068

    Statements

    DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM (English)
    0 references
    0 references
    0 references
    4 December 2002
    0 references
    longest common subsequence
    0 references

    Identifiers