Validating the Knuth-Morris-Pratt Failure Function, Fast and Online-Reference-Cited by-同舟云学术

Validating the Knuth-Morris-Pratt Failure Function, Fast and Online

Published:2013-12-06 Issue:2 Volume:54 Page:337-372
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Gawrychowski Paweł,Jeż Artur,Jeż Łukasz

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s00224-013-9522-8/fulltext.html

Reference24 articles.

1. Breslauer, D., Colussi, L., Toniolo, L.: On the comparison complexity of the string prefix-matching problem. J. Algorithms 29(1), 18–67 (1998)

2. Clément, J., Crochemore, M., Rindone, G.: Reverse engineering prefix tables. In: Proceedings of 26th STACS, pp. 289–300 (2009). http://drops.dagstuhl.de/opus/volltexte/2009/1825

3. Cole, R., Hariharan, R.: Dynamic lca queries on trees. In: Proceedings of SODA ’99, pp. 235–244. Society for Industrial and Applied Mathematics, Philadelphia (1999)

4. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific Publishing Company, Singapore (2002)

5. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)

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

1. Reconstructing parameterized strings from parameterized suffix and LCP arrays;Theoretical Computer Science;2024-01

2. String inference from longest-common-prefix array;Theoretical Computer Science;2023-01

3. On Suffix Tree Detection;String Processing and Information Retrieval;2023

4. Universal reconstruction of a string;Theoretical Computer Science;2020-04

5. Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info;International Journal of Foundations of Computer Science;2019-09