Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Longest_palindromic_substring> ?p ?o }
Showing triples 1 to 42 of
42
with 100 triples 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 wikiPageLength "10789".
- Longest_palindromic_substring wikiPageOutDegree "11".
- Longest_palindromic_substring wikiPageRevisionID "672251312".
- Longest_palindromic_substring wikiPageWikiLink Category:Palindromes.
- Longest_palindromic_substring wikiPageWikiLink Category:Problems_on_strings.
- Longest_palindromic_substring wikiPageWikiLink Computer_science.
- Longest_palindromic_substring wikiPageWikiLink Journal_of_the_ACM.
- Longest_palindromic_substring wikiPageWikiLink Linear_time.
- Longest_palindromic_substring wikiPageWikiLink Palindrome.
- Longest_palindromic_substring wikiPageWikiLink Parallel_algorithm.
- Longest_palindromic_substring wikiPageWikiLink Subsequence.
- Longest_palindromic_substring wikiPageWikiLink Substring.
- Longest_palindromic_substring wikiPageWikiLink Suffix_tree.
- Longest_palindromic_substring wikiPageWikiLink Theoretical_Computer_Science_(journal).
- Longest_palindromic_substring wikiPageWikiLink Time_complexity.
- Longest_palindromic_substring wikiPageWikiLinkText "Longest palindromic substring".
- Longest_palindromic_substring wikiPageWikiLinkText "longest palindromic substring".
- Longest_palindromic_substring hasPhotoCollection Longest_palindromic_substring.
- Longest_palindromic_substring wikiPageUsesTemplate Template:Citation.
- Longest_palindromic_substring wikiPageUsesTemplate Template:Harvtxt.
- Longest_palindromic_substring wikiPageUsesTemplate Template:Reflist.
- Longest_palindromic_substring subject Category:Palindromes.
- Longest_palindromic_substring subject Category:Problems_on_strings.
- Longest_palindromic_substring hypernym Problem.
- Longest_palindromic_substring type Disease.
- Longest_palindromic_substring type Language.
- Longest_palindromic_substring type Algorithm.
- Longest_palindromic_substring type Combinatoric.
- Longest_palindromic_substring type Language.
- 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 Поиск_длиннейшей_подстроки-палиндрома.
- Longest_palindromic_substring sameAs Проблем_најдужег_палиндрома_у_стрингу.
- Longest_palindromic_substring sameAs Q6673742.
- Longest_palindromic_substring sameAs Q6673742.
- Longest_palindromic_substring wasDerivedFrom Longest_palindromic_substring?oldid=672251312.
- Longest_palindromic_substring isPrimaryTopicOf Longest_palindromic_substring.