Forty Years of Text Indexing
From MaRDI portal
Publication:4928554
Recommendations
- Indexation Et Recherche D'Informations Dans Les Hypertextes
- Bibliometric analysis of the automatic indexing literature: 1956--2000
- scientific article; zbMATH DE number 2150301
- Indexes for document retrieval with relevance
- Breaking a time-and-space barrier in constructing full-text indices
- scientific article; zbMATH DE number 1974070
- Indexing hypertext
Cites work
- scientific article; zbMATH DE number 1003304 (Why is no real title available?)
- scientific article; zbMATH DE number 432779 (Why is no real title available?)
- scientific article; zbMATH DE number 3883638 (Why is no real title available?)
- scientific article; zbMATH DE number 4007744 (Why is no real title available?)
- scientific article; zbMATH DE number 3690687 (Why is no real title available?)
- scientific article; zbMATH DE number 3551946 (Why is no real title available?)
- scientific article; zbMATH DE number 2038766 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 1786458 (Why is no real title available?)
- scientific article; zbMATH DE number 2086666 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- scientific article; zbMATH DE number 871936 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings
- Algorithms on Strings, Trees and Sequences
- Automata and forbidden words
- Complete inverted files for efficient text retrieval and analysis
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Compressing and indexing labeled trees, with applications
- Constructing suffix arrays in linear time
- Data compression via textual substitution
- Data structures and algorithms for the string statistics problem
- Detection of periodicities and string-matching in real time
- Efficient On-Line Construction and Correction of Position Trees
- Fast Algorithms for Finding Nearest Common Ancestors
- Indexing compressed text
- Let sleeping files lie: Pattern matching in Z-compressed files.
- Linear Algorithm for Data Compression via String Matching
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Minimal forbidden words and symbolic dynamics
- On the Complexity of Finite Sequences
- On-line construction of suffix trees
- On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
- Optimal off-line detection of repetitions in a string
- Optimal parallel algorithms for string matching
- Parallel construction of a suffix tree with applications
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
- Space efficient linear time construction of suffix arrays
- Suffix Arrays: A New Method for On-Line String Searches
- The macro model for data compression (extended abstract)
- The myriad virtues of wavelet trees
- The smallest automaton recognizing the subwords of a text
- Time optimal left to right construction of position trees
- Transducers and repetitions
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Using minimal absent words to build phylogeny
Cited in
(2)
This page was built for publication: Forty Years of Text Indexing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928554)
