Forty Years of Text Indexing

DOI10.1007/978-3-642-38905-4_1zbMATH Open1381.68067OpenAlexW1114413066MaRDI QIDQ4928554FDOQ4928554

Authors:

Publication date: 14 June 2013

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-01246128/file/ACFGM2013.pdf

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

zbMATH Keywords

pattern matchingstring searchingfactor automatonsuffix treesuffix arraydirected acyclic word graphwavelet treeFM-indexsuffix automatonDAWGbi-tree

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05) Algorithms on strings (68W32) Computing methodologies for text processing; mathematical typography (68U15)

Cites Work

• Algorithms on Strings, Trees and Sequences
• Compressing and indexing labeled trees, with applications
• Indexing compressed text
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Complexity of Finite Sequences
• Optimal off-line detection of repetitions in a string
• Suffix Arrays: A New Method for On-Line String Searches
• A Space-Economical Suffix Tree Construction Algorithm
• Title not available (Why is that?)
• Parallel construction of a suffix tree with applications
• The smallest automaton recognizing the subwords of a text
• Linear time algorithms for finding and representing all the tandem repeats in a string
• On-line construction of suffix trees
• Automata and forbidden words
• Fast Algorithms for Finding Nearest Common Ancestors
• Linear Algorithm for Data Compression via String Matching
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal forbidden words and symbolic dynamics
• Algorithms on Strings
• Transducers and repetitions
• Space efficient linear time construction of suffix arrays
• The macro model for data compression (extended abstract)
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Data compression via textual substitution
• Data structures and algorithms for the string statistics problem
• Constructing suffix arrays in linear time
• Title not available (Why is that?)
• Complete inverted files for efficient text retrieval and analysis
• Using minimal absent words to build phylogeny
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• Let sleeping files lie: Pattern matching in Z-compressed files.
• The myriad virtues of wavelet trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
• Optimal parallel algorithms for string matching
• Time optimal left to right construction of position trees
• Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
• Title not available (Why is that?)
• Detection of periodicities and string-matching in real time
• Title not available (Why is that?)
• Efficient On-Line Construction and Correction of Position Trees

Cited In (3)

• Dynamic and internal longest common substring
• A suffix tree or not a suffix tree?
• Longest common substring made fully dynamic

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)