Q141001

From Wikidata
Jump to: navigation, search

Longest common subsequence problem (Q141001) [edit]

the problem of finding a sequence that is a subsequence of each of a given set of sequences and is as long as possible [edit]

No aliases defined.
    [edit]

    Statements

    [edit]
    [edit]
    [edit]
    [edit]
    [edit]