Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Shortest_common_supersequence> ?p ?o. }
Showing items 1 to 38 of
38
with 100 items per page.
- Shortest_common_supersequence abstract "In computer science, the shortest common supersequence problem is a problem closely related to the longest common subsequence problem. Given two sequences X = < x1,...,xm > and Y = < y1,...,yn >, a sequence U = < u1,...,uk > is a common supersequence of X and Y if U is a supersequence of both X and Y. In other words, a shortest common supersequence of strings x and y is a shortest string z such that both x and y are subsequences of z.A shortest common supersequence (scs) is a common supersequence of minimal length. In the shortest common supersequence problem, the two sequences X and Y are given and the task is to find a shortest possible common supersequence of these sequences. In general, an scs is not unique.For two input sequences, an scs can be formed from a longest common subsequence (lcs) easily. For example, if Xand Y, the lcs is Z. By inserting the non-lcs symbols while preserving the symbol order, we get the scs: U.It is quite clear that for two input sequences. However, for three or more input sequences this does not hold. Note also, that the lcs and the scs problems are not dual problems.".
- Shortest_common_supersequence wikiPageExternalLink shortestCommonSuperseq.html.
- Shortest_common_supersequence wikiPageID "2699476".
- Shortest_common_supersequence wikiPageRevisionID "605862235".
- Shortest_common_supersequence hasPhotoCollection Shortest_common_supersequence.
- Shortest_common_supersequence subject Category:Combinatorics.
- Shortest_common_supersequence subject Category:Dynamic_programming.
- Shortest_common_supersequence subject Category:Formal_languages.
- Shortest_common_supersequence subject Category:Problems_on_strings.
- Shortest_common_supersequence type Abstraction100002137.
- Shortest_common_supersequence type Act100030358.
- Shortest_common_supersequence type Activity100407535.
- Shortest_common_supersequence type Algorithm105847438.
- Shortest_common_supersequence type AlgorithmsOnStrings.
- Shortest_common_supersequence type Attribute100024264.
- Shortest_common_supersequence type Communication100033020.
- Shortest_common_supersequence type Condition113920835.
- Shortest_common_supersequence type Difficulty114408086.
- Shortest_common_supersequence type Event100029378.
- Shortest_common_supersequence type FormalLanguages.
- Shortest_common_supersequence type Language106282651.
- Shortest_common_supersequence type Problem114410605.
- Shortest_common_supersequence type ProblemsOnStrings.
- Shortest_common_supersequence type Procedure101023820.
- Shortest_common_supersequence type PsychologicalFeature100023100.
- Shortest_common_supersequence type Rule105846932.
- Shortest_common_supersequence type State100024720.
- Shortest_common_supersequence type YagoPermanentlyLocatedEntity.
- Shortest_common_supersequence comment "In computer science, the shortest common supersequence problem is a problem closely related to the longest common subsequence problem. Given two sequences X = < x1,...,xm > and Y = < y1,...,yn >, a sequence U = < u1,...,uk > is a common supersequence of X and Y if U is a supersequence of both X and Y.".
- Shortest_common_supersequence label "Najkrótszy wspólny nadłańcuch".
- Shortest_common_supersequence label "Shortest common supersequence".
- Shortest_common_supersequence sameAs Najkrótszy_wspólny_nadłańcuch.
- Shortest_common_supersequence sameAs m.07yq_k.
- Shortest_common_supersequence sameAs Q11789272.
- Shortest_common_supersequence sameAs Q11789272.
- Shortest_common_supersequence sameAs Shortest_common_supersequence.
- Shortest_common_supersequence wasDerivedFrom Shortest_common_supersequence?oldid=605862235.
- Shortest_common_supersequence isPrimaryTopicOf Shortest_common_supersequence.