Skip to content

Added a new algorithm for matching non-overlapping substrings.

David Broman requested to merge david-broman/legion:quick-matching-substrings into automatic-tracing

The new algorithm makes use of suffix arrays and the LCP data structure. The overall algorithm has time complexity O(n log n).

Merge request reports