Text Indexing and Searching in Sublinear Time
© 2020 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved. 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.
Leibniz International Proceedings in Informatics, LIPIcs
Text Indexing and Searching in Sublinear Time.
Leibniz International Proceedings in Informatics, LIPIcs,
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/2693