Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Longest_common_subsequence_problem> ?p ?o. }
Showing items 1 to 37 of
37
with 100 items per page.
- Longest_common_subsequence_problem abstract "The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two). (Note that a subsequence is different from a substring, for the terms of the former need not be consecutive terms of the original sequence.) It is a classic computer science problem, the basis of file comparison programs such as diff, and has applications in bioinformatics.".
- Longest_common_subsequence_problem wikiPageExternalLink longestCommonSubsequence.html.
- Longest_common_subsequence_problem wikiPageExternalLink Longest_common_subsequence.
- Longest_common_subsequence_problem wikiPageID "236105".
- Longest_common_subsequence_problem wikiPageRevisionID "596872736".
- Longest_common_subsequence_problem hasPhotoCollection Longest_common_subsequence_problem.
- Longest_common_subsequence_problem subject Category:Combinatorics.
- Longest_common_subsequence_problem subject Category:Dynamic_programming.
- Longest_common_subsequence_problem subject Category:NP-complete_problems.
- Longest_common_subsequence_problem subject Category:Polynomial-time_problems.
- Longest_common_subsequence_problem subject Category:Problems_on_strings.
- Longest_common_subsequence_problem type Abstraction100002137.
- Longest_common_subsequence_problem type Attribute100024264.
- Longest_common_subsequence_problem type Condition113920835.
- Longest_common_subsequence_problem type Difficulty114408086.
- Longest_common_subsequence_problem type NP-completeProblems.
- Longest_common_subsequence_problem type Polynomial-timeProblems.
- Longest_common_subsequence_problem type Problem114410605.
- Longest_common_subsequence_problem type ProblemsOnStrings.
- Longest_common_subsequence_problem type State100024720.
- Longest_common_subsequence_problem comment "The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two). (Note that a subsequence is different from a substring, for the terms of the former need not be consecutive terms of the original sequence.) It is a classic computer science problem, the basis of file comparison programs such as diff, and has applications in bioinformatics.".
- Longest_common_subsequence_problem label "Longest common subsequence problem".
- Longest_common_subsequence_problem label "Massima sottosequenza comune".
- Longest_common_subsequence_problem label "Najdłuższy wspólny podciąg".
- Longest_common_subsequence_problem label "Plus longue sous-séquence commune".
- Longest_common_subsequence_problem label "Наибольшая общая подпоследовательность".
- Longest_common_subsequence_problem label "最长公共子序列".
- Longest_common_subsequence_problem sameAs Plus_longue_sous-séquence_commune.
- Longest_common_subsequence_problem sameAs Massima_sottosequenza_comune.
- Longest_common_subsequence_problem sameAs 최장_공통_부분_수열.
- Longest_common_subsequence_problem sameAs Najdłuższy_wspólny_podciąg.
- Longest_common_subsequence_problem sameAs m.01j8s4.
- Longest_common_subsequence_problem sameAs Q141001.
- Longest_common_subsequence_problem sameAs Q141001.
- Longest_common_subsequence_problem sameAs Longest_common_subsequence_problem.
- Longest_common_subsequence_problem wasDerivedFrom Longest_common_subsequence_problem?oldid=596872736.
- Longest_common_subsequence_problem isPrimaryTopicOf Longest_common_subsequence_problem.