Repetition-free longest common subsequence (Q5901069)

From MaRDI portal
Revision as of 20:21, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 5770506
Language Label Description Also known as
English
Repetition-free longest common subsequence
scientific article; zbMATH DE number 5770506

    Statements

    title
    Repetition-free longest common subsequence (English)
    0 references
    author
    Said S. Adi
    0 references
    Marília D. V. Braga
    0 references
    Cristina G. Fernandes
    0 references
    Carlos E. Ferreira
    0 references
    Marie-France Sagot
    0 references
    Marco A. Stefanes
    0 references
    Yoshiko Wakabayashi
    0 references
    publication date
    13 August 2010
    0 references
    zbMATH Keywords
    longest common subsequence
    0 references
    APX-hardness
    0 references
    approximation algorithms
    0 references

    Identifiers

    zbMATH DE Number
    5770506
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5901069&oldid=12979035"
    Powered by MediaWiki