@inproceedings{b1ba6c1e18814d00860c7dfb0ff4638c,

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 log2 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(n1.5) time for integer alphabets [Gawrychowski et al., 2015].",

keywords = "Border, Factorisation, Longest unbordered factor, Period, Strings",

author = "Tomasz Kociumaka and Ritu Kundu and Manal Mohamed and Pissis, {Solon P.}",

year = "2018",

month = dec,

day = "1",

doi = "10.4230/LIPIcs.ISAAC.2018.70",

language = "English",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

pages = "70:1--70:13",

editor = "Chung-Shou Liao and Wen-Lian Hsu and Der-Tsai Lee",

booktitle = "29th International Symposium on Algorithms and Computation, ISAAC 2018",

note = "29th International Symposium on Algorithms and Computation, ISAAC 2018 ; Conference date: 16-12-2018 Through 19-12-2018",

}