Fast Circular Pattern Matching
Published in ArXiv, 2022
This paper proposes a novel approach to the Circular Pattern Matching Problem using Suffix Trees. Work was performed at Montana State University, funded by an NSF REU grant.
Recommended citation: Solow, W., Barich, M., & Mumey, B. (2022). Fast circular pattern matching. arXiv. https://arxiv.org/abs/2204.09562.
Download Paper