Document Type

Conference Proceeding

Publication Date



Department of Computer Science


We introduce the first index that can be built in o(n) time for a text of length n, and can also be queried in o(q) time for a pattern of length q. On an alphabet of size, our index uses O(n log) bits, is built in O(n log f/plog n) deterministic time, and computes the number of occurrences of the pattern in time O(q/logf n+log n logf n). Each such occurrence can then be found in O(log n) time. Other trade-offs between the space usage and the cost of reporting occurrences are also possible. 2012 ACM Subject Classification Theory of computation ! Data structures design and analysis.

Publisher's Statement

J. Ian Munro, Gonzalo Navarro, and Yakov Nekrich. © 2020 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved. Publisher’s version of record:

Publication Title

Leibniz International Proceedings in Informatics, LIPIcs

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.


Publisher's PDF



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.