Results 1  10
of
850,450
Positionrestricted substring searching
 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2006
"... A fulltext index is a data structure built over a text string T[1, n]. The most basic functionality provided is (a) counting how many times a pattern string P[1, m] appears in T and (b) locating all those occ positions. There exist several indexes that solve (a) in O(m) time and (b) in O(occ) tim ..."
Abstract

Cited by 28 (7 self)
 Add to MetaCart
A fulltext index is a data structure built over a text string T[1, n]. The most basic functionality provided is (a) counting how many times a pattern string P[1, m] appears in T and (b) locating all those occ positions. There exist several indexes that solve (a) in O(m) time and (b) in O
• Remarks and Open Problems Classic String Indexing
"... • Positionrestricted substring searching • Indexing substrings with intervals • Indexing substrings with gaps ..."
Abstract
 Add to MetaCart
• Positionrestricted substring searching • Indexing substrings with intervals • Indexing substrings with gaps
Substring range reporting
, 2011
"... We revisit various string indexing problems with range reporting features, namely, positionrestricted substring searching, indexing substrings with gaps, and indexing substrings with intervals. We obtain the following main results. • We give efficient reductions for each of the above problems to a ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We revisit various string indexing problems with range reporting features, namely, positionrestricted substring searching, indexing substrings with gaps, and indexing substrings with intervals. We obtain the following main results. • We give efficient reductions for each of the above problems
• Results • 2D range reporting approach • New solution
"... • Positionrestricted substring searching • Indexing substrings with intervals • Indexing substrings with gaps • Remarks and Open ProblemsClassic String Indexing S = senselessness • Preprocess string S of length n. • Report(P): Given pattern P of length m, report all occurrences of P in S. • Suffix ..."
Abstract
 Add to MetaCart
• Positionrestricted substring searching • Indexing substrings with intervals • Indexing substrings with gaps • Remarks and Open ProblemsClassic String Indexing S = senselessness • Preprocess string S of length n. • Report(P): Given pattern P of length m, report all occurrences of P in S. • Suffix
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
"... We present a succinct representation of a set of n points on an n × n grid using n lg n + o(nlg n) bits 3 to support orthogonal range counting in O(lg n / lg lg n) time, and range reporting in O(k lg n/lg lg n) time, where k is the size of the output. This achieves an improvement on query time by ..."
Abstract

Cited by 32 (3 self)
 Add to MetaCart
applications in text indexing. In particular, we apply it to improve two previous spaceefficient text indexes that support substring search [7] and positionrestricted substring search [15]. We also use it to extend previous results on succinct representations of sequences of small integers, and to design
Optimal Prefix and Suffix Queries on Texts
, 2013
"... Abstract. In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied Mäkinen and Navarro [PositionRestricted Substring Searching, LATIN 2006]. In the problem handled in this paper, we are interested in those occurrences of the pattern tha ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied Mäkinen and Navarro [PositionRestricted Substring Searching, LATIN 2006]. In the problem handled in this paper, we are interested in those occurrences of the pattern
Rank and select revisited and extended
 Workshop on SpaceConscious Algorithms, University of
, 2006
"... The deep connection between the BurrowsWheeler transform (BWT) and the socalled rank and select data structures for symbol sequences is the basis of most successful approaches to compressed text indexing. Rank of a symbol at a given position equals the number of times the symbol appears in the corr ..."
Abstract

Cited by 49 (24 self)
 Add to MetaCart
to substring rank and select, giving several space/time tradeoffs for the problem. An application of these queries is in positionrestricted substring searching, where one can specify the range in the text where the search is restricted to, and only occurrences residing in that range are to be reported
Costly search and mutual fund flows
 Journal of Finance
, 1998
"... This paper studies the flows of funds into and out of equity mutual funds. Consumers base their fund purchase decisions on prior performance information, but do so asymmetrically, investing disproportionately more in funds that performed very well the prior period. Search costs seem to be an importa ..."
Abstract

Cited by 511 (5 self)
 Add to MetaCart
This paper studies the flows of funds into and out of equity mutual funds. Consumers base their fund purchase decisions on prior performance information, but do so asymmetrically, investing disproportionately more in funds that performed very well the prior period. Search costs seem
Suffix arrays: A new method for online string searches
, 1991
"... A new and conceptually simple data structure, called a suffix array, for online string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffix arrays over suffix trees is that ..."
Abstract

Cited by 827 (0 self)
 Add to MetaCart
is that, in practice, they use three to five times less space. From a complexity standpoint, suffix arrays permit online string searches of the type, "Is W a substring of A?" to be answered in time O(P + log N), where P is the length of W and N is the length of A, which is competitive with (and
The FF planning system: Fast plan generation through heuristic search
 Journal of Artificial Intelligence Research
, 2001
"... We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be ind ..."
Abstract

Cited by 822 (53 self)
 Add to MetaCart
We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts
Results 1  10
of
850,450