New algorithms on wavelet trees and applications to information retrieval
Reads0
Chats0
TLDR
In this article, the authors show how to use wavelet trees to solve fundamental algorithmic problems such as range quantile queries, range next value queries, and range intersection queries.About:
This article is published in Theoretical Computer Science.The article was published on 2012-04-01 and is currently open access. It has received 100 citations till now. The article focuses on the topics: Document retrieval & Wavelet.read more
Citations
More filters
Book ChapterDOI
Succinct de bruijn graphs
TL;DR: A new succinct de Bruijn graph representation of k-mers in a DNA sequence of length N has m edges, which can be represented in 4m+o(m) bits much smaller than existing ones.
Journal ArticleDOI
Wavelet trees for all
TL;DR: This survey gives an overview of wavelet trees and the surprising number of applications in which they are useful: basic and weighted point grids, sets of rectangles, strings, permutations, binary relations, graphs, inverted indexes, document retrieval indexes, full-text indexes, XML indexes, and general numeric sequences.
Book ChapterDOI
Wavelet trees for all
TL;DR: This survey gives an overview of wavelet trees and the surprising number of applications in which they are useful: basic and weighted point grids, sets of rectangles, strings, permutations, binary relations, graphs, inverted indexes, document retrieval indexes, full-text indexes, XML indexes, and general numeric sequences.
Journal ArticleDOI
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
TL;DR: In this article, the authors cover the recent research in extending the document retrieval techniques to a broader class of sequence collections and uncover a rich world of relations between document retrieval challenges and fundamental problems on trees, strings, range queries, discrete geometry, and other areas.
Journal ArticleDOI
Wheeler graphs: A framework for BWT-based data structures
TL;DR: This paper proposes a framework that includes many of these variations of the BWT by designing straightforward finite-state automata for the relevant problems and showing that their state diagrams are Wheeler graphs.
References
More filters
Book
Modern Information Retrieval
TL;DR: In this article, the authors present a rigorous and complete textbook for a first course on information retrieval from the computer science (as opposed to a user-centred) perspective, which provides an up-to-date student oriented treatment of the subject.
Journal ArticleDOI
Suffix arrays: a new method for on-line string searches
Udi Manber,Gene Myers +1 more
TL;DR: A new and conceptually simple data structure, called a suffixarray, for on-line string searches is introduced in this paper, and it is believed that suffixarrays will prove to be better in practice than suffixtrees for many applications.
Journal ArticleDOI
Time bounds for selection
TL;DR: The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a linear function of n by analysis of a new selection algorithm-PICK.
Journal ArticleDOI
Inverted files for text search engines
Justin Zobel,Alistair Moffat +1 more
TL;DR: This tutorial introduces the key techniques in the area of text indexing, describing both a core implementation and how the core can be enhanced through a range of extensions.