Home›Combinatorics›بزرگترین زیردنباله مشترک🌐فارسیEnglishDeutschEspañolFrançaisItalianoPolskiTiếng ViệtРусскийالعربيةفارسی한국어中文日本語EntityQ141001· pop 19· linked from 79 articlesبزرگترین زیردنباله مشترکAlso known as LCSthe problem of finding a sequence that is a subsequence of each of a given set of sequences and is as long as possibleAvailable in 19 languagesEspañolFrançais中文日本語РусскийItalianoالعربيةBelarusianCzechConnectionsRon RivestEntitydiffEntityCategoriesCombinatoricsDynamic programmingNP-complete problemsPolynomial-time problemsProblems on strings