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
BOND: Basic OligoNucleotide Design
TL;DR: According to Kane’s criteria for oligo design, BOND computes highly specific DNA oligonucleotides, for all the genes that admit unique probes, while running orders of magnitude faster than the existing programs.
Journal ArticleDOI
Repetitive perhaps, but certainly not boring
TL;DR: In this article, a survey of the work done on repetitions in strings is presented, especially that of an algorithmic nature, and several open problems are described and conjectures formulated about some of them.
On-line algorithms for k-Covering
TL;DR: It is shown that the time complexity bounds for computing a minimum set of k-covers and k-segments for a given circular string of length n are O(n2(n-k), and further that the number of such minimum sets of k -covers may be exponential.
Journal ArticleDOI
The three squares lemma revisited
TL;DR: The motivation for this research is to show that the maximum number of runs in a string is at most n, and to provide a combinatorial basis for a new generation of algorithms that directly compute repetitions in strings without elaborate preprocessing.
Journal ArticleDOI
A new approach to the periodicity lemma on strings with holes
William F. Smyth,Shu Wang +1 more
TL;DR: An algorithm is described that, given the locations of the holes in a string, computes maximum-length substrings to which the periodicity lemma applies, in time proportional to the number of holes.