longest common subsequence problem

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

en-GB/ˈlɒŋɡɪst ˈkɒmən sʌbsɪkwəns ˈpɹɒbləm/
en-US/ˈlɑŋɡɪst ˈkɑmən ˈsʌbˌsikwəns ˈpɹɑbləm/

Катэгорыі:

computational problem