W
William F. Smyth
Researcher at McMaster University
Publications - 181
Citations - 3703
William F. Smyth is an academic researcher from McMaster University. The author has contributed to research in topics: String (computer science) & Substring. The author has an hindex of 32, co-authored 177 publications receiving 3547 citations. Previous affiliations of William F. Smyth include University of Western Australia & Murdoch University.
Papers
More filters
Journal ArticleDOI
Optimal algorithms for computing the canonical form of a circular string
TL;DR: An O(log n) time CRCW PRAM algorithm for computing the least lexicographic rotation of a circular string (of length n) over a fixed alphabet is presented here.
Journal ArticleDOI
A family of sparse graphs of large sum number
Nora Hartsfield,William F. Smyth +1 more
TL;DR: In this paper, it was shown that for wheels Wn of (sufficiently large) order n + 1 and size m = 2n, σ(Wn) = n/2 + 3 if n is even and n ⩽ σ (Wn), ⌈ n + 2 if n was odd.
Journal ArticleDOI
Minimum Unique Substrings and Maximum Repeats
Lucian Ilie,William F. Smyth +1 more
TL;DR: A strong duality is discovered between minimum unique substrings and maximum repeats which, in particular, allows fast computation of one from the other.
Proceedings Article
Fast Optimal Algorithms for Computing All the Repeats in a String
TL;DR: A new algorithm PSY1 is described that, based on suffix array construction, computes all the complete nonextendible repeats in x of length p greater than or equal to pmin, which is an order of magnitude faster than the two other algorithms previously proposed for this problem.