Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Longest_repeated_substring_problem> ?p ?o. }
Showing items 1 to 34 of
34
with 100 items per page.
- Longest_repeated_substring_problem abstract "In computer science, the longest repeated substring problem is the problem of finding the longest substring of a string that occurs at least twice. This problem can be solved in linear time and space by building a suffix tree for the string, and finding the deepest internal node in the tree. Depth is measured by the number of characters traversed from the root. The string spelled by the edges from the root to such a node is a longest repeated substring. The problem of finding the longest substring with at least occurrences can be found by first preprocessing the tree to count the number of leaf descendants for each internal node, and then finding the deepest node with at least descendants.".
- Longest_repeated_substring_problem wikiPageID "3980340".
- Longest_repeated_substring_problem wikiPageRevisionID "578826694".
- Longest_repeated_substring_problem hasPhotoCollection Longest_repeated_substring_problem.
- Longest_repeated_substring_problem subject Category:Combinatorics.
- Longest_repeated_substring_problem subject Category:Formal_languages.
- Longest_repeated_substring_problem subject Category:Problems_on_strings.
- Longest_repeated_substring_problem type Abstraction100002137.
- Longest_repeated_substring_problem type Act100030358.
- Longest_repeated_substring_problem type Activity100407535.
- Longest_repeated_substring_problem type Algorithm105847438.
- Longest_repeated_substring_problem type AlgorithmsOnStrings.
- Longest_repeated_substring_problem type Attribute100024264.
- Longest_repeated_substring_problem type Communication100033020.
- Longest_repeated_substring_problem type Condition113920835.
- Longest_repeated_substring_problem type Difficulty114408086.
- Longest_repeated_substring_problem type Event100029378.
- Longest_repeated_substring_problem type FormalLanguages.
- Longest_repeated_substring_problem type Language106282651.
- Longest_repeated_substring_problem type Problem114410605.
- Longest_repeated_substring_problem type ProblemsOnStrings.
- Longest_repeated_substring_problem type Procedure101023820.
- Longest_repeated_substring_problem type PsychologicalFeature100023100.
- Longest_repeated_substring_problem type Rule105846932.
- Longest_repeated_substring_problem type State100024720.
- Longest_repeated_substring_problem type YagoPermanentlyLocatedEntity.
- Longest_repeated_substring_problem comment "In computer science, the longest repeated substring problem is the problem of finding the longest substring of a string that occurs at least twice. This problem can be solved in linear time and space by building a suffix tree for the string, and finding the deepest internal node in the tree. Depth is measured by the number of characters traversed from the root. The string spelled by the edges from the root to such a node is a longest repeated substring.".
- Longest_repeated_substring_problem label "Longest repeated substring problem".
- Longest_repeated_substring_problem sameAs m.0b9vz1.
- Longest_repeated_substring_problem sameAs Q6673747.
- Longest_repeated_substring_problem sameAs Q6673747.
- Longest_repeated_substring_problem sameAs Longest_repeated_substring_problem.
- Longest_repeated_substring_problem wasDerivedFrom Longest_repeated_substring_problem?oldid=578826694.
- Longest_repeated_substring_problem isPrimaryTopicOf Longest_repeated_substring_problem.