FRINK Linked Data Fragments server

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

• W2024147613 endingPage "1011" @default.
• W2024147613 startingPage "987" @default.
• W2024147613 abstract "The suffix tree of a string is the fundamental data structure of combinatorial pattern matching. We present a recursive technique for building suffix trees that yields optimal algorithms in different computational models. Sorting is an inherent bottleneck in building suffix trees and our algorithms match the sorting lower bound. Specifically, we present the following results. (1) Weiner [1973], who introduced the data structure, gave an optimal 0 ( n )-time algorithm for building the suffix tree of an n -character string drawn from a constant-size alphabet. In the comparison model, there is a trivial Ο( n log n )-time lower bound based on sorting, and Weiner's algorithm matches this bound. For integer alphabets, the fastest known algorithm is the O ( n log n )time comparison-based algorithm, but no super-linear lower bound is known. Closing this gap is the main open question in stringology. We settle this open problem by giving a linear time reduction to sorting for building suffix trees. Since sorting is a lower-bound for building suffix trees, this algorithm is time-optimal in every alphabet mode. In particular, for an alphabet consisting of integers in a polynomial range we get the first known linear-time algorithm. (2) All previously known algorithms for building suffix trees exhibit a marked absence of locality of reference, and thus they tend to elicit many page faults (I/Os) when indexing very long strings. They are therefore unsuitable for building suffix trees in secondary storage devices, where I/Os dominate the overall computational cost. We give a linear-I/O reduction to sorting for suffix tree construction. Since sorting is a trivial I/O-lower bound for building suffix trees, our algorithm is I/O-optimal." @default.
• W2024147613 created "2016-06-24" @default.
• W2024147613 creator A5045502987 @default.
• W2024147613 creator A5046786328 @default.
• W2024147613 creator A5087023890 @default.
• W2024147613 date "2000-11-01" @default.
• W2024147613 modified "2023-09-24" @default.
• W2024147613 title "On the sorting-complexity of suffix tree construction" @default.
• W2024147613 cites W1577268071 @default.
• W2024147613 cites W1850450091 @default.
• W2024147613 cites W2011999472 @default.
• W2024147613 cites W2015326607 @default.
• W2024147613 cites W2033340210 @default.
• W2024147613 cites W2038142281 @default.
• W2024147613 cites W2087721273 @default.
• W2024147613 cites W2121252285 @default.
• W2024147613 cites W2158874082 @default.
• W2024147613 cites W2168395296 @default.
• W2024147613 cites W2762948820 @default.
• W2024147613 doi "https://doi.org/10.1145/355541.355547" @default.
• W2024147613 hasPublicationYear "2000" @default.
• W2024147613 type Work @default.
• W2024147613 sameAs 2024147613 @default.
• W2024147613 citedByCount "177" @default.
• W2024147613 countsByYear W20241476132012 @default.
• W2024147613 countsByYear W20241476132013 @default.
• W2024147613 countsByYear W20241476132014 @default.
• W2024147613 countsByYear W20241476132015 @default.
• W2024147613 countsByYear W20241476132016 @default.
• W2024147613 countsByYear W20241476132017 @default.
• W2024147613 countsByYear W20241476132018 @default.
• W2024147613 countsByYear W20241476132019 @default.
• W2024147613 countsByYear W20241476132020 @default.
• W2024147613 countsByYear W20241476132021 @default.
• W2024147613 countsByYear W20241476132022 @default.
• W2024147613 countsByYear W20241476132023 @default.
• W2024147613 crossrefType "journal-article" @default.
• W2024147613 hasAuthorship W2024147613A5045502987 @default.
• W2024147613 hasAuthorship W2024147613A5046786328 @default.
• W2024147613 hasAuthorship W2024147613A5087023890 @default.
• W2024147613 hasBestOaLocation W20241476131 @default.
• W2024147613 hasConcept C100903775 @default.
• W2024147613 hasConcept C111696304 @default.
• W2024147613 hasConcept C11413529 @default.
• W2024147613 hasConcept C114614502 @default.
• W2024147613 hasConcept C118146561 @default.
• W2024147613 hasConcept C118615104 @default.
• W2024147613 hasConcept C134306372 @default.
• W2024147613 hasConcept C138885662 @default.
• W2024147613 hasConcept C157486923 @default.
• W2024147613 hasConcept C162319229 @default.
• W2024147613 hasConcept C199360897 @default.
• W2024147613 hasConcept C2779259728 @default.
• W2024147613 hasConcept C2779804580 @default.
• W2024147613 hasConcept C2781166958 @default.
• W2024147613 hasConcept C311688 @default.
• W2024147613 hasConcept C33923547 @default.
• W2024147613 hasConcept C37914503 @default.
• W2024147613 hasConcept C41008148 @default.
• W2024147613 hasConcept C41895202 @default.
• W2024147613 hasConcept C77553402 @default.
• W2024147613 hasConcept C7757238 @default.
• W2024147613 hasConceptScore W2024147613C100903775 @default.
• W2024147613 hasConceptScore W2024147613C111696304 @default.
• W2024147613 hasConceptScore W2024147613C11413529 @default.
• W2024147613 hasConceptScore W2024147613C114614502 @default.
• W2024147613 hasConceptScore W2024147613C118146561 @default.
• W2024147613 hasConceptScore W2024147613C118615104 @default.
• W2024147613 hasConceptScore W2024147613C134306372 @default.
• W2024147613 hasConceptScore W2024147613C138885662 @default.
• W2024147613 hasConceptScore W2024147613C157486923 @default.
• W2024147613 hasConceptScore W2024147613C162319229 @default.
• W2024147613 hasConceptScore W2024147613C199360897 @default.
• W2024147613 hasConceptScore W2024147613C2779259728 @default.
• W2024147613 hasConceptScore W2024147613C2779804580 @default.
• W2024147613 hasConceptScore W2024147613C2781166958 @default.
• W2024147613 hasConceptScore W2024147613C311688 @default.
• W2024147613 hasConceptScore W2024147613C33923547 @default.
• W2024147613 hasConceptScore W2024147613C37914503 @default.
• W2024147613 hasConceptScore W2024147613C41008148 @default.
• W2024147613 hasConceptScore W2024147613C41895202 @default.
• W2024147613 hasConceptScore W2024147613C77553402 @default.
• W2024147613 hasConceptScore W2024147613C7757238 @default.
• W2024147613 hasIssue "6" @default.
• W2024147613 hasLocation W20241476131 @default.
• W2024147613 hasOpenAccess W2024147613 @default.
• W2024147613 hasPrimaryLocation W20241476131 @default.
• W2024147613 hasRelatedWork W117230746 @default.
• W2024147613 hasRelatedWork W1556086214 @default.
• W2024147613 hasRelatedWork W1807007002 @default.
• W2024147613 hasRelatedWork W2068421750 @default.
• W2024147613 hasRelatedWork W2118703123 @default.
• W2024147613 hasRelatedWork W2136043658 @default.
• W2024147613 hasRelatedWork W2158874082 @default.
• W2024147613 hasRelatedWork W2408769612 @default.
• W2024147613 hasRelatedWork W2964305773 @default.
• W2024147613 hasRelatedWork W3089043377 @default.
• W2024147613 hasVolume "47" @default.

• next