Search found 1 match

Go to advanced search

by polch
Tue Aug 30, 2005 12:54 am
Forum: Volume 108 (10800-10899)
Topic: 10829 - L-Gap Substrings
Replies: 14
Views: 11460

!!!!!!!!!!!!!!! SPOILER - ATTENTION !!!!!!!!!!!!!!!!!!!!!!!!!!!







Hi,I solved this task using KMR + binary search in O(n*(logn)^2).

For each k being length of U I counted all subwords UVU of text in O(n/k*logk). (|V|=g)

Adrian, how fast (asympt.) algo have you got?

Go to advanced search