On the Complexity of Determining the Period of a String-Reference-Cited by-同舟云学术

On the Complexity of Determining the Period of a String

Published:2000 Issue: Volume: Page:412-422
ISSN:0302-9743
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

Czumaj Artur,Gçasieniec Leszek

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45123-4_34

Reference45 articles.

1. A. V. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity, chapter 5, pages 257–300. Elsevier Science, Amsterdam, 1990.

2. A. Amir and G. Benson. Two-dimensional periodicity in rectangular arrays. SIAM Journal on Computing, 27(1):90–106, February 1998.

3. A. Amir, G. Benson, and M. Farach. Alphabet independent two dimensional matching. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 59–68, Victoria, British Columbia, Canada, May 4–6, 1992. ACM Press, New York, NY.

4. A. Amir, G. Benson, and M. Farach. An alphabet independent approach to two-dimensional pattern matching. SIAM Journal on Computing, 23(2):313–323, April 1994.

5. A. Apostolico and M. Crochemore. Optimal canonization of all substrings of a string. Information and Computation, 95(1):76–95, November 1991

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

1. On the Shortest Common Superstring of NGS Reads;Lecture Notes in Computer Science;2017

2. Periodicity and Cyclic Shifts via Linear Sketches;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2011

3. Periodicity in Streams;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2010

4. Approximating Tree Edit Distance through String Edit Distance;Algorithmica;2008-07-30

5. The period Constraint;Logic Programming;2004