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
A taxonomy of suffix array construction algorithms
TL;DR: A survey of suffix array construction algorithms can be found in this article, with a comparison of the algorithms' worst-case time complexity and use of additional space, together with results of recent experimental test runs on many of their implementations.
Book
Computing Patterns in Strings
TL;DR: A basic general introduction to the algorithms (methods) that efficiently compute patterns in strings, which is fundamental to many fields molecular biology, cryptography, data compression, computer vision, speech recognition, computational geometry, and many others.
Journal ArticleDOI
A fast and effective heuristic for the feedback arc set problem
TL;DR: A simple FAS algorithm which guarantees a good (though not optimal) performance bound and executes in time O(m) is presented and achieves the same asymptotic performance bound that Berger-Shor does.
Journal ArticleDOI
Computing the Cover Array in Linear Time
Yin Li,William F. Smyth +1 more
TL;DR: This paper introduces an array γ = γ[1..n] called the cover array in which each element γ, 1 ≤ i ≤ n, is the length of the longest proper cover of x[1…i] or zero if no such cover exists.
Journal ArticleDOI
A characterization of the squares in a Fibonacci string
TL;DR: This paper provides a characterization of all the squares in F, hence in every prefix Fn; this characterization naturally gives rise to a algorithm which specifiesall the squares of Fn in an appropriate encoding.