Linear computation of unbordered conjugate on unordered alphabet

Authors:
J. -P. Duval;T. Lecroq;A. Lefebvre
Affiliations:
-;-;-
Venue:
Theoretical Computer Science
Year:
2014

Citing 6
Cited 0

Optimal canonization of all substrings of a string

Information and Computation
Rotations of periodic strings and short superstrings

Journal of Algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Reconstructing strings from substrings in rounds

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Algorithms on Strings

Algorithms on Strings
Periodicity and unbordered words: A proof of the extended duval conjecture

Journal of the ACM (JACM)

Quantified Score

Hi-index	5.23

Visualization

Abstract

We present an algorithm that, given a word w of length n on an unordered alphabet, computes one of its unbordered conjugates. If such a conjugate does not exist, the algorithm computes one of its conjugates that is a power of an unbordered word. The time complexity of the algorithm is O(n): the number of comparisons between letters of w is bounded by 4n.