Efficient and Effective Algorithms for Searching Strings in Secondary Storage

Abstract

Pattern searching is fundamental to a wide range of computing applications, including web search and bioinformatics. In this project we will develop compression algorithms and hybrid memory-disk search structures that allow fast pattern matching on sequences of textual and numeric data, including when approximate search is required.

Related publications (2)

On Identifying Phrases Using Collection Statistics

S Gog, A Moffat, M Petri

2015-01-01

Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays

Simon Gog, Alistair Moffat, J Shane Culpepper, Andrew Turpin, Anthony Wirth

2014-08-01