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
Facts
4 properties- Instance of
- computational problem
- Short name
- LCS[2]
- Computational complexity
- NP-complete[4]
- Different from
- longest common substring problem[3]
🏷️ Also known as
en LCS
en longest common subsequence problem
ar أطول تسلسل مشترك
cs hledání nejdelší společné podposloupnosti
de Problem der längsten gemeinsamen Teilsequenz
es problema de subsecuencia común mas larga
fa بزرگترین زیردنبالهٔ مشترک
fa بزرگترین زیردنباله مشترک
fa بزرگ ترین زیردنباله مشترک
fa بزرگترین زیردنباله مشترک
fa بزرگترین زیردنبالهٔ مشترک
fa بزرگ ترین زیردنبالهٔ مشترک
fr plus longue sous-séquence commune
it massima sottosequenza comune
ja 最長共通部分列問題
ko 최장 공통 부분 수열
pl Najdłuższy wspólny podciąg
pl Nwp
ru Наибольшая общая подпоследовательность
uk Пошук найдовшої спільної підпослідовності
🔖 Identifiers · 5
- OpenAlex ID
- C120098539
- Dictionary of Algorithms and Data Structures ID
- LCS, longestCommonSubsequence
- Freebase ID
- /m/01j8s4
- Microsoft Academic ID (discontinued)
- 120098539
- Stack Exchange tag
- stackoverflow.com
🔗 Connections
Computational complexity 1
Different from 1
Instance of 1
← Different from 1
Press Enter · cited answer in seconds
0 sources
Summary
longest common subsequence problem is a computational problem[1].