W. F. Smyth

Publication Activity (10 Years)

Years Active: 1971-2023
Publications (10 Years): 25

Top Topics

Finite Alphabet

Approximate String Matching

Shortest Common Supersequence

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Fundam. Informaticae

Publications

G. Brian Golding, Holly Koponen, Neerja Mhaskar, W. F. Smyth
Computing Maximal Covers for Protein Sequences. J. Comput. Biol. 30 (2) (2023)
Mai Alzamel, Jacqueline W. Daykin, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, W. F. Smyth
Local Maximal Equality-Free Periodicities. AIAI Workshops (2023)
Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth
V-Words, Lyndon Words and Substring circ-UMFFs. COCOA (1) (2023)
Hossein Dehghani, Neerja Mhaskar, W. F. Smyth
Practical KMP/BM Style Pattern-Matching on Indeterminate Strings. CoRR (2022)
Neerja Mhaskar, W. F. Smyth
String Covering: A Survey. Fundam. Informaticae 190 (1) (2022)
Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth
-order. Theor. Comput. Sci. 880 (2021)
Felipe A. Louza, Neerja Mhaskar, W. F. Smyth
A new approach to regular & indeterminate strings. Theor. Comput. Sci. 854 (2021)
Felipe A. Louza, Neerja Mhaskar, W. F. Smyth
A New Approach to Regular & Indeterminate Strings. CoRR (2020)
Amy Glen, Jamie Simpson, W. F. Smyth
More properties of the Fibonacci word on an infinite alphabet. Theor. Comput. Sci. 795 (2019)
Mai Alzamel, Costas S. Iliopoulos, W. F. Smyth, Wing-Kin Sung
Off-line and on-line algorithms for closed string factorization. Theor. Comput. Sci. 792 (2019)
Amy Glen, Jamie Simpson, W. F. Smyth
Palindromes in starlike trees. Australas. J Comb. 73 (2019)
Ali Alatabbi, Jacqueline W. Daykin, Neerja Mhaskar, M. Sohel Rahman, W. F. Smyth
Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index. WALCOM (2019)
Jacqueline W. Daykin, Frantisek Franek, Jan Holub, A. S. M. Sohidull Islam, W. F. Smyth
Reconstructing a string from its Lyndon arrays. Theor. Comput. Sci. 710 (2018)
Joel Helling, P. J. Ryan, W. F. Smyth, Michael Soltys
Constructing an indeterminate string from its associated graph. Theor. Comput. Sci. 710 (2018)
Neerja Mhaskar, W. F. Smyth
Frequency Covers for Strings. Fundam. Informaticae 163 (3) (2018)
Amy Glen, Jamie Simpson, W. F. Smyth
Palindromes in starlike trees. CoRR (2018)
Zsuzsanna Lipták, W. F. Smyth
Preface. Discret. Appl. Math. 246 (2018)
Richard Beal, Donald A. Adjeroh, W. F. Smyth
A prefix array for parameterized strings. J. Discrete Algorithms 42 (2017)
Amy Glen, Jamie Simpson, W. F. Smyth
Counting Lyndon Factors. Electron. J. Comb. 24 (3) (2017)
Felipe A. Louza, W. F. Smyth, Giovanni Manzini, Guilherme P. Telles
Lyndon Array Construction during Burrows-Wheeler Inversion. CoRR (2017)
Amy Glen, Jamie Simpson, W. F. Smyth
More properties of the Fibonacci word on an infinite alphabet. CoRR (2017)
Peter Burcsi, Zsuzsanna Lipták, W. F. Smyth
On the Parikh-de-Bruijn grid. CoRR (2017)
Ali Alatabbi, Jacqueline W. Daykin, Juha Kärkkäinen, M. Sohel Rahman, W. F. Smyth
V-Order: New combinatorial properties & a simple comparison algorithm. Discret. Appl. Math. 215 (2016)
Ali Alatabbi, Abu Sayed Md. Sohidull Islam, Mohammad Sohel Rahman, Jamie Simpson, W. F. Smyth
Enhanced Covers of Regular and Indeterminate Strings Using Prefix Tables. J. Autom. Lang. Comb. 21 (3) (2016)
Ali Alatabbi, M. Sohel Rahman, W. F. Smyth
Computing covers using prefix tables. Discret. Appl. Math. 212 (2016)
R. Bharati, W. F. Smyth
Editorial. J. Discrete Algorithms 33 (2015)
Manolis Christodoulakis, P. J. Ryan, W. F. Smyth, Shu Wang
Indeterminate Strings, Prefix Arrays & Undirected Graphs. CoRR (2014)
David E. Daykin, Jacqueline W. Daykin, W. F. Smyth
V-order. Theor. Comput. Sci. 483 (2013)
David E. Daykin, Jacqueline W. Daykin, Costas S. Iliopoulos, W. F. Smyth
Generic Algorithms for Factoring Strings. Information Theory, Combinatorics, and Search Theory (2013)
Widmer Bland, Gregory Kucherov, W. F. Smyth
Prefix Table Construction and Conversion. IWOCA (2013)
Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W. F. Smyth, Wojciech Tyczynski
Enhanced string covering. Theor. Comput. Sci. 506 (2013)
W. F. Smyth
Computing regularities in strings: A survey. Eur. J. Comb. 34 (1) (2013)
Frantisek Franek, Ayse Karaman, W. F. Smyth
Repetitions in Sturmian strings. Theor. Comput. Sci. 249 (2) (2000)
W. F. Smyth
Repetitive perhaps, but certainly not boring. Theor. Comput. Sci. 249 (2) (2000)
Nora Hartsfield, W. F. Smyth
A family of sparse graphs of large sum number. Discret. Math. 141 (1-3) (1995)
Peter Eades, Xuemin Lin, W. F. Smyth
A Fast and Effective Heuristic for the Feedback Arc Set Problem. Inf. Process. Lett. 47 (6) (1993)
Lou Caccetta, W. F. Smyth
Graphs of maximum diameter. Discret. Math. 102 (2) (1992)
W. F. Smyth
Mu-Balancing M-Way Search Trees. Comput. J. 34 (5) (1991)
K. A. Redish, W. F. Smyth
Closed form expressions for the iterated floor function. Discret. Math. 91 (3) (1990)
K. A. Redish, W. F. Smyth
Evaluating Measures of Program Quality. Comput. J. 30 (3) (1987)
K. A. Redish, W. F. Smyth
Program Style Analysis: A Natural By-Product of Program Compilation. Commun. ACM 29 (2) (1986)
W. F. Smyth, N. W. N. Jayasiri
The Encouragement of Effective Computer Use in Developing Countries. IFIP Congress (1980)
W. F. Smyth, Ilona Arany
Another algorithm for reducing bandwidth and profile of a sparse matrix. AFIPS National Computer Conference (1976)
W. F. Smyth, E. Radaceanu
A Storage Scheme for Hierarchic Structures. Comput. J. 17 (2) (1974)
W. F. Smyth, W. M. L. Benzi
An Algorithm for Finding the Diameter of a Graph. IFIP Congress (1974)
Ilona Arany, Lajos Szoda, W. F. Smyth
An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices. IFIP Congress (2) (1971)