Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Longest_palindromic_substring> ?p ?o. }
Showing items 1 to 29 of
29
with 100 items per page.
- Longest_palindromic_substring abstract "In computer science, the longest palindromic substring or longest symmetric factor problem is the problem of finding a maximum-length contiguous substring of a given string that is also a palindrome. For example, the longest palindromic substring of "bananas" is "anana". The longest palindromic substring is not guaranteed to be unique; for example, in the string "abracadabra", there is no palindromic substring with length greater than three, but there are two palindromic substrings with length three, namely, "aca" and "ada". In some applications it may be necessary to return all maximal palindromic substrings (that is, all substrings that are themselves palindromes and cannot be extended to larger palindromic substrings) rather than returning only one substring or returning the maximum length of a palindromic substring.Manacher (1975) found a linear time algorithm for listing all the palindromes that appear at the start of a given string. However, as observed e.g., by Apostolico, Breslauer & Galil (1995), the same algorithm can also be used to find all maximal palindromic substrings anywhere within the input string, again in linear time. Therefore, it provides a linear time solution to the longest palindromic substring problem. Alternative linear time solutions were provided by Jeuring (1994), and by Gusfield (1997), who described a solution based on suffix trees. Efficient parallel algorithms are also known for the problem.The longest palindromic substring problem should not be confused with the different problem of finding the longest palindromic subsequence.".
- Longest_palindromic_substring wikiPageExternalLink 3.0.
- Longest_palindromic_substring wikiPageExternalLink index.php?title=Longest_palindromic_substring.
- Longest_palindromic_substring wikiPageID "33593580".
- Longest_palindromic_substring wikiPageRevisionID "603753762".
- Longest_palindromic_substring hasPhotoCollection Longest_palindromic_substring.
- Longest_palindromic_substring subject Category:Palindromes.
- Longest_palindromic_substring subject Category:Problems_on_strings.
- Longest_palindromic_substring type Abstraction100002137.
- Longest_palindromic_substring type Attribute100024264.
- Longest_palindromic_substring type Condition113920835.
- Longest_palindromic_substring type Difficulty114408086.
- Longest_palindromic_substring type LanguageUnit106284225.
- Longest_palindromic_substring type Palindrome106294828.
- Longest_palindromic_substring type Palindromes.
- Longest_palindromic_substring type Part113809207.
- Longest_palindromic_substring type Problem114410605.
- Longest_palindromic_substring type ProblemsOnStrings.
- Longest_palindromic_substring type Relation100031921.
- Longest_palindromic_substring type State100024720.
- Longest_palindromic_substring type Word106286395.
- Longest_palindromic_substring comment "In computer science, the longest palindromic substring or longest symmetric factor problem is the problem of finding a maximum-length contiguous substring of a given string that is also a palindrome. For example, the longest palindromic substring of "bananas" is "anana".".
- Longest_palindromic_substring label "Longest palindromic substring".
- Longest_palindromic_substring sameAs m.0hgr093.
- Longest_palindromic_substring sameAs Q6673742.
- Longest_palindromic_substring sameAs Q6673742.
- Longest_palindromic_substring sameAs Longest_palindromic_substring.
- Longest_palindromic_substring wasDerivedFrom Longest_palindromic_substring?oldid=603753762.
- Longest_palindromic_substring isPrimaryTopicOf Longest_palindromic_substring.