Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory

  title={Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory},
  author={Simon J. Puglisi and William F. Smyth and Andrew Turpin},
Recent advances in the asymptotic resource costs of pattern matching with compressed suffix arrays are attractive, but a key rival structure, the compressed inverted file, has been dismissed or ignored in papers presenting the new structures. In this paper we examine the resource requirements of compressed suffix array algorithms against compressed inverted file data structures for general pattern matching in genomic and English texts. In both cases, the inverted file indexes q-grams, thus… CONTINUE READING
Highly Cited
This paper has 55 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 29 extracted citations

55 Citations

Citations per Year
Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 33 references

Compressed full-text indexes

ACM Comput. Surv. • 2007
View 4 Excerpts
Highly Influenced

Basic local alignment search tool.

View 6 Excerpts
Highly Influenced

Suffix arrays: a new model for on-line string searches

U. Manber, G. W. Myers
SIAM Journal of Computing, 22(5):935–948, • 1993
View 3 Excerpts
Highly Influenced


D. A. Benson, I. Karsch-Mizrachi, D. J. Lipman, J. Ostell, D. L. Wheeler
Nucleic Acids Research, 33:D34–D38, • 2005
View 1 Excerpt

and G

P. Ferragin
Navarro. Pizza& Chili Corpus – Compressed Indexes and their Testbeds, • 2005
View 1 Excerpt

Similar Papers

Loading similar papers…