Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem (Q4932075): Difference between revisions

From MaRDI portal
Newer edit →
Importer (talk | contribs)
Bots
7,029,448 edits
‎Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 08:15, 8 February 2024

scientific article; zbMATH DE number 5794266
Language Label Description Also known as
English
Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem
scientific article; zbMATH DE number 5794266

    Statements

    title
    Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem (English)
    0 references
    DOI
    10.3233/FI-2010-256
    0 references
    publication date
    1 October 2010
    0 references
    zbMATH DE Number
    5794266
    0 references
    zbMATH Keywords
    constrained longest common subsequence
    0 references
    longest common subsequence
    0 references
    dynamic programming
    0 references
    bit-parallel algorithm
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4932075&oldid=19338801"
    Powered by MediaWiki