Suffix trays and suffix trists: structures for faster text indexing (Q2354023): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
aliases / en / 0aliases / en / 0
 
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing
description / endescription / en
scientific article
scientific article; zbMATH DE number 5528735
Property / title
 
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing (English)
Property / title: Suffix Trays and Suffix Trists: Structures for Faster Text Indexing (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1223.68029 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/11786986_32 / rank
 
Normal rank
Property / published in
 
Property / published in: Automata, Languages and Programming / rank
 
Normal rank
Property / publication date
 
12 March 2009
Timestamp+2009-03-12T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 12 March 2009 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5528735 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2887278666 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1486336060 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1311.1762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Replacing suffix trees with enhanced suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near real-time suffix tree construction via the fringe marked ancestor problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sorting-complexity of suffix tree construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear work suffix array construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing suffix arrays in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space efficient linear time construction of suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Range Searching for Text Indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix Arrays: A New Method for On-Line String Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Efficient Dictionaries in Close to Sorting Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank

Latest revision as of 11:33, 10 July 2024

scientific article; zbMATH DE number 5528735
  • Suffix Trays and Suffix Trists: Structures for Faster Text Indexing
Language Label Description Also known as
English
Suffix trays and suffix trists: structures for faster text indexing
scientific article; zbMATH DE number 5528735
  • Suffix Trays and Suffix Trists: Structures for Faster Text Indexing

Statements

Suffix trays and suffix trists: structures for faster text indexing (English)
0 references
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing (English)
0 references
0 references
0 references
0 references
10 July 2015
0 references
12 March 2009
0 references
data structures
0 references
indexing
0 references
pattern matching
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references