FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1708789860> ?p ?o ?g. }

• W1708789860 endingPage "130" @default.
• W1708789860 startingPage "119" @default.
• W1708789860 abstract "The longest common extension (LCE) problem is to preprocess a string in order to allow for a large number of LCE queries, such that the queries are efficient. The LCE value, LCEs(i,j), is the length of the longest common prefix of the pair of suffixes starting at index i and j in the string s. The LCE problem can be solved in linear space with constant query time and a preprocessing of sorting complexity. There are two known approaches achieving these bounds, which use nearest common ancestors and range minimum queries, respectively. However, in practice a much simpler approach with linear query time, no extra space and no preprocessing achieves significantly better average case performance. We show a new algorithm, Fingerprintk, which for a parameter k, 1≤k≤⌈logn ⌉, on a string of length n and alphabet size σ, gives O(kn1/k) query time using O(kn) space and O(kn+sort(n,σ)) preprocessing time, where sort(n,σ) is the time it takes to sort n numbers from σ. Though this solution is asymptotically strictly worse than the asymptotically best previously known algorithms, it outperforms them in practice in average case and is almost as fast as the simple linear time algorithm. On worst case input, this new algorithm is significantly faster in practice compared to the simple linear time algorithm. We also look at cache performance of the new algorithm, and we show that for k=2, cache optimization can improve practical query time." @default.
• W1708789860 created "2016-06-24" @default.
• W1708789860 creator A5042029066 @default.
• W1708789860 creator A5070148734 @default.
• W1708789860 creator A5083100766 @default.
• W1708789860 date "2012-01-01" @default.
• W1708789860 modified "2023-09-27" @default.
• W1708789860 title "Longest Common Extensions via Fingerprinting" @default.
• W1708789860 cites W2002246332 @default.
• W1708789860 cites W2011999472 @default.
• W1708789860 cites W2024147613 @default.
• W1708789860 cites W2078889228 @default.
• W1708789860 cites W2149098716 @default.
• W1708789860 cites W2434820933 @default.
• W1708789860 doi "https://doi.org/10.1007/978-3-642-28332-1_11" @default.
• W1708789860 hasPublicationYear "2012" @default.
• W1708789860 type Work @default.
• W1708789860 sameAs 1708789860 @default.
• W1708789860 citedByCount "2" @default.
• W1708789860 countsByYear W17087898602016 @default.
• W1708789860 countsByYear W17087898602019 @default.
• W1708789860 crossrefType "book-chapter" @default.
• W1708789860 hasAuthorship W1708789860A5042029066 @default.
• W1708789860 hasAuthorship W1708789860A5070148734 @default.
• W1708789860 hasAuthorship W1708789860A5083100766 @default.
• W1708789860 hasConcept C41008148 @default.
• W1708789860 hasConceptScore W1708789860C41008148 @default.
• W1708789860 hasLocation W17087898601 @default.
• W1708789860 hasOpenAccess W1708789860 @default.
• W1708789860 hasPrimaryLocation W17087898601 @default.
• W1708789860 hasRelatedWork W2093578348 @default.
• W1708789860 hasRelatedWork W2096946506 @default.
• W1708789860 hasRelatedWork W2350741829 @default.
• W1708789860 hasRelatedWork W2358668433 @default.
• W1708789860 hasRelatedWork W2376932109 @default.
• W1708789860 hasRelatedWork W2382290278 @default.
• W1708789860 hasRelatedWork W2390279801 @default.
• W1708789860 hasRelatedWork W2748952813 @default.
• W1708789860 hasRelatedWork W2766271392 @default.
• W1708789860 hasRelatedWork W2899084033 @default.
• W1708789860 isParatext "false" @default.
• W1708789860 isRetracted "false" @default.
• W1708789860 magId "1708789860" @default.
• W1708789860 workType "book-chapter" @default.