Paper Info
Title
Longest Unbordered Factor in Quasilinear Time.
Abstract
A border u of a word w is a proper factor of w occurring both as a prefix and as a suffix. The maximal unbordered factor of w is the longest factor of w which does not have a border. Here an O(n log n)-time with high probability (or O(n log n log^2 log n)-time deterministic) algorithm to compute the Longest Unbordered Factor Array of w for general alphabets is presented, where n is the length of w. This array specifies the length of the maximal unbordered factor starting at each position of w. This is a major improvement on the running time of the currently best worst-case algorithm working in O(n^{1.5}) time for integer alphabets [Gawrychowski et al., 2015].
Year
DOI
Venue
2018
10.4230/LIPIcs.ISAAC.2018.70
ISAAC
DocType
Volume
Citations 
Conference
abs/1805.09924
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Tomasz Kociumaka121738.57
Ritu Kundu2173.76
Manal Mohamed310212.62
Solon P. Pissis428157.09