Efficient and Effective Algorithms for Searching Strings in Secondary Storage

Grant number: DP110101743 | Funding period: 2011 - 2014

Completed

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.