Buy Me a Coffee at ko-fi.com

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

Pronunciation
/ˈlɔŋgəst ˈkɑmən ˈsəbˌsikwəns ˈprɑbləm/
/ˈlɒŋɡɪst ˈkɒmən ˈsʌbsɪkwəns ˈprɒbləm/