Matches in DBpedia 2014 for { <http://dbpedia.org/resource/LCP_array> ?p ?o. }
Showing items 1 to 20 of
20
with 100 items per page.
- LCP_array abstract "In computer science, the longest common prefix array (LCP array) is an auxiliary data structure to the suffix array. It stores the lengths of the longest common prefixes between pairs of consecutive suffixes in the sorted suffix array. In other words, it is the length of prefix that is common between the two consecutive suffixes in a sorted suffix array.Example:LCP of a and aabba is 1.LCP of abaabba and abba is 2. Augmenting the suffix array with the LCP array allows to efficiently simulate top-down and bottom-up traversals of the suffix tree, speeds up pattern matching on the suffix array and is a prerequisite for compressed suffix trees.".
- LCP_array wikiPageExternalLink text-indexing.
- LCP_array wikiPageExternalLink citation.cfm?id=1759210.1759301.
- LCP_array wikiPageExternalLink alx11_03_gogs.pdf.
- LCP_array wikiPageExternalLink Traversals.java.
- LCP_array wikiPageExternalLink sais-lite-lcp.
- LCP_array wikiPageExternalLink sdsl.
- LCP_array wikiPageID "36849795".
- LCP_array wikiPageRevisionID "605905891".
- LCP_array hasPhotoCollection LCP_array.
- LCP_array subject Category:Arrays.
- LCP_array subject Category:String_data_structures.
- LCP_array subject Category:Substring_indices.
- LCP_array comment "In computer science, the longest common prefix array (LCP array) is an auxiliary data structure to the suffix array. It stores the lengths of the longest common prefixes between pairs of consecutive suffixes in the sorted suffix array. In other words, it is the length of prefix that is common between the two consecutive suffixes in a sorted suffix array.Example:LCP of a and aabba is 1.LCP of abaabba and abba is 2.".
- LCP_array label "LCP array".
- LCP_array sameAs m.0n47pq1.
- LCP_array sameAs Q6457433.
- LCP_array sameAs Q6457433.
- LCP_array wasDerivedFrom LCP_array?oldid=605905891.
- LCP_array isPrimaryTopicOf LCP_array.