Substring Range Reporting-Reference-Cited by-同舟云学术

Substring Range Reporting

Published:2013-01-09 Issue:2 Volume:69 Page:384-396
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Bille Philip,Gørtz Inge Li

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-012-9733-4.pdf

Reference32 articles.

1. Alstrup, S., Brodal, G., Rauhe, T.: Optimal static range reporting in one dimension. In: Proc. of the 33rd Symposium on Theory of Computing, pp. 476–482 (2001)

2. Alstrup, S., Stølting Brodal, G., Rauhe, T.: New data structures for orthogonal range searching. In: Proc. of the 41st Symposium on Foundations of Computer Science, pp. 198–207 (2000)

3. Amir, A., Chencinski, E., Iliopoulos, C.S., Kopelowitz, T., Zhang, H.: Property matching and weighted matching. Theor. Comput. Sci. 395(2–3), 298–310 (2008)

4. Lecture Notes in Computer Science;P. Bose,2009

5. Chan, T.M., Larsen, K., Pǎtraşcu, M.: Orthogonal range searching on the RAM, revisited. In: Proc. of the 27th Symposium on Computational Geometry, pp. 1–10 (2011)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Gapped Indexing for Consecutive Occurrences;Algorithmica;2022-10-20

2. String indexing for top-k close consecutive occurrences;Theoretical Computer Science;2022-08

3. I/O-efficient data structures for non-overlapping indexing;Theoretical Computer Science;2021-02

4. Fast Indexes for Gapped Pattern Matching;SOFSEM 2020: Theory and Practice of Computer Science;2020

5. Position-restricted substring searching over small alphabets;Journal of Discrete Algorithms;2017-09