Solving the String Statistics Problem in Time $$ \mathcal{O} $$ (nlogn)-Reference-Cited by-同舟云学术

Solving the String Statistics Problem in Time $$ \mathcal{O} $$ (nlogn)

Published:2002 Issue: Volume: Page:728-739
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Brodal Gerth Stølting,Lyngsø Rune B.,Östlin Anna,Pedersen Christian N. S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45465-9_62

Reference19 articles.

1. A. Apostolico and A. Ehrenfeucht. Efficient detection of quasiperiodicities in strings. Theoretical Computer Science, 119:247–265, 1993.

2. A. Apostolico and F. P. Preparata. Optimal off-line detection of repetitions in a string. Theoretical Computer Science, 22:297–315, 1983.

3. A. Apostolico and F. P. Preparata. Data structures and algorithms for the string statistics problem. Algorithmica, 15:481–494, 1996.

4. G. S. Brodal, R. Lyngsø, C. N. S. Pedersen, and J. Stoye. Finding maximal pairs with bounded gap. Journal of Discrete Algorithms, Special Issue of Matching Patterns, 1(1):77–104, 2000.

5. G. S. Brodal, R. B. Lyngsø, A. Ostlin, and C. N. S. Pedersen. Solving the string statistics problem in time O(n log n). Technical Report RS-02-13, BRICS, Department of Computer Science, University of Aarhus, 2002.

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

1. Period Recovery over the Hamming and Edit Distances;LATIN 2016: Theoretical Informatics;2016

2. Forty Years of Text Indexing;Combinatorial Pattern Matching;2013

3. Fast Algorithm for Partial Covers in Words;Combinatorial Pattern Matching;2013

4. Searching for smallest grammars on large sequences and application to DNA;Journal of Discrete Algorithms;2012-02

5. Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts;SOFSEM 2012: Theory and Practice of Computer Science;2012