William F. Smyth

Lucian Ilie, Hamid Mohamadi, Geoffrey Brian Golding, William F. Smyth: BOND: Basic OligoNucleotide Design. BMC Bioinformatics 14: 69 (2013)

W. F. Smyth: Computing regularities in strings: A survey. Eur. J. Comb. 34(1): 3-14 (2013)

David E. Daykin, Jacqueline W. Daykin, W. F. Smyth: A linear partitioning algorithm for Hybrid Lyndons using VV-order. Theor. Comput. Sci. 483: 149-161 (2013)

Anisa Al-Hafeedh, Maxime Crochemore, Lucian Ilie, Evguenia Kopylova, William F. Smyth, German Tischler, Munina Yusufu: A comparison of index-based lempel-Ziv LZ77 factorization algorithms. ACM Comput. Surv. 45(1): 5 (2012)

Jacqueline W. Daykin, Bill Smyth, Lynette van Zijl: Editorial. J. Discrete Algorithms 10: 1 (2012)

Evguenia Kopylova, William F. Smyth: The three squares lemma revisited. J. Discrete Algorithms 11: 3-14 (2012)

Costas S. Iliopoulos, William F. Smyth: Editorial. J. Discrete Algorithms 14: 1 (2012)

Costas S. Iliopoulos, William F. Smyth: Editorial. J. Discrete Algorithms 16: 1 (2012)

Frantisek Franek, Robert C. G. Fuller, Jamie Simpson, William F. Smyth: More results on overlapping squares. J. Discrete Algorithms 17: 2-8 (2012)

Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, William F. Smyth, Wojciech Tyczynski: New and Efficient Approaches to the Quasiperiodic Characterisation of a String. Stringology 2012: 75-88

Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth: Quasi-linear Time Computation of the Abelian Periods of a Word. Stringology 2012: 103-110

S. Arumugam, W. F. Smyth (Eds.): Combinatorial Algorithms, 23rd International Workshop, IWOCA 2012, Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7643, Springer 2012, isbn 978-3-642-35925-5

Lucian Ilie, William F. Smyth: Minimum Unique Substrings and Maximum Repeats. Fundam. Inform. 110(1-4): 183-195 (2011)

Costas S. Iliopoulos, Manal Mohamed, William F. Smyth: New complexity results for the k-covers problem. Inf. Sci. 181(12): 2571-2575 (2011)

David E. Daykin, Jacqueline W. Daykin, William F. Smyth: String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time. CPM 2011: 65-76

Costas S. Iliopoulos, William F. Smyth (Eds.): Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6460, Springer 2011, isbn 978-3-642-19221-0

Costas S. Iliopoulos, William F. Smyth (Eds.): Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7056, Springer 2011, isbn 978-3-642-25010-1

Simon J. Puglisi, William F. Smyth, Munina Yusufu: Fast, Practical Algorithms for Computing All the Repeats in a String. Mathematics in Computer Science 3(4): 373-389 (2010)

Farida Ridzuan, Vidyasagar Potdar, Alex Talevski, William F. Smyth: Key Parameters in Identifying Cost of Spam 2.0. AINA 2010: 789-796

David E. Daykin, Jacqueline W. Daykin, William F. Smyth: Combinatorics of Unique Maximal Factorization Families (UMFFs). Fundam. Inform. 97(3): 295-309 (2009)

Costas S. Iliopoulos, William F. Smyth, Munina Yusufu: Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences. Fundam. Inform. 97(3): 311-320 (2009)

William F. Smyth, Shu Wang: An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings. Int. J. Found. Comput. Sci. 20(6): 985-1004 (2009)

William F. Smyth, Shu Wang: A new approach to the periodicity lemma on strings with holes. Theor. Comput. Sci. 410(43): 4295-4302 (2009)

Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth: Identifying Rhythms in Musical Texts. Int. J. Found. Comput. Sci. 19(1): 37-51 (2008)

Jan Holub, William F. Smyth, Shu Wang: Fast pattern-matching on indeterminate strings. J. Discrete Algorithms 6(1): 37-50 (2008)

Gang Chen, Simon J. Puglisi, William F. Smyth: Lempel-Ziv Factorization Using Less Time & Space. Mathematics in Computer Science 1(4): 605-623 (2008)

Simon J. Puglisi, Jamie Simpson, William F. Smyth: How many runs can a string contain? Theor. Comput. Sci. 401(1-3): 165-171 (2008)

Maxime Crochemore, Lucian Ilie, William F. Smyth: A Simple Algorithm for Computing the Lempel Ziv Factorization. DCC 2008: 482-488

William F. Smyth, Shu Wang: New Perspectives on the Prefix Array. SPIRE 2008: 133-143

William F. Smyth, Shu Wang, Mao Yu: An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings. Stringology 2008: 95-107

Simon J. Puglisi, William F. Smyth, Munina Yusufu: Fast Optimal Algorithms for Computing All the Repeats in a String. Stringology 2008: 161-169

Simon J. Puglisi, William F. Smyth, Andrew Turpin: A taxonomy of suffix array construction algorithms. ACM Comput. Surv. 39(2) (2007)

Manolis Christodoulakis, Geoffrey Brian Golding, Costas S. Iliopoulos, Yoan José Pinzón Ardila, William F. Smyth: Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences. Journal of Computational Biology 14(7): 1001-1010 (2007)

Frantisek Franek, Christopher G. Jennings, William F. Smyth: A simple fast hybrid pattern-matching algorithm. J. Discrete Algorithms 5(4): 682-695 (2007)

Frantisek Franek, Jiandong Jiang, William F. Smyth: Two-pattern strings II - frequency of occurrence and substring complexity. J. Discrete Algorithms 5(4): 739-748 (2007)

Gang Chen, Simon J. Puglisi, William F. Smyth: Fast and Practical Algorithms for Computing All the Runs in a String. CPM 2007: 307-315

Hamid Abdul Basit, Simon J. Puglisi, William F. Smyth, Andrew Turpin, Stan Jarzabek: Efficient token based clone detection with flexible tokenization. ESEC/SIGSOFT FSE (Companion) 2007: 513-516

Frantisek Franek, William F. Smyth: Reconstructing a Suffix Array. Int. J. Found. Comput. Sci. 17(6): 1281-1296 (2006)

Kangmin Fan, Simon J. Puglisi, William F. Smyth, Andrew Turpin: A New Periodicity Lemma. SIAM J. Discrete Math. 20(3): 656-668 (2006)

Simon J. Puglisi, William F. Smyth, Andrew Turpin: Suffix arrays: what are they good for? ADC 2006: 17-18

M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth: Finding Patterns with Variable Length Gaps or Don't Cares. COCOON 2006: 146-155

Simon J. Puglisi, William F. Smyth, Andrew Turpin: Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory. SPIRE 2006: 122-133

Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth: Song classifications for dancing. Stringology 2006: 41-48

Frantisek Franek, William F. Smyth: Sorting suffixes of two-pattern strings. Int. J. Found. Comput. Sci. 16(6): 1135-1144 (2005)

Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang: The Complexity of the Minimum k-Cover Problem. Journal of Automata, Languages and Combinatorics 10(5/6): 641-653 (2005)

Kangmin Fan, William F. Smyth, R. J. Simpson: A New Periodicity Lemma. CPM 2005: 257-265

Frantisek Franek, Christopher G. Jennings, William F. Smyth: A Simple Fast Hybrid Pattern-Matching Algorithm. CPM 2005: 288-297

Simon J. Puglisi, William F. Smyth, Andrew Turpin: The Performance of Linear Time Suffix Sorting Algorithms. DCC 2005: 358-367

Simon J. Puglisi, William F. Smyth, Andrew Turpin: A taxonomy of suffix array construction algorithms. Stringology 2005: 1-30

Frantisek Franek, William F. Smyth: Reconstructing a suffix array. Stringology 2005: 54-68

Frantisek Franek, William F. Smyth: Sorting suffixes of two-pattern strings. Stringology 2004: 69-78

Frantisek Franek, William F. Smyth, Yudong Tang: Computing All Repeats Using Suffix Arrays. Journal of Automata, Languages and Combinatorics 8(4): 579-591 (2003)

Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao: Computing Quasi Suffix Arrays. Journal of Automata, Languages and Combinatorics 8(4): 593-606 (2003)

Frantisek Franek, Weilin Lu, William F. Smyth: Two-pattern strings I - A recognition algorithm. J. Discrete Algorithms 1(5-6): 445-460 (2003)

Frantisek Franek, William F. Smyth, Xiangdong Xiao: A Note on Crochemore's Repetitions Algorithm - A Fast Space-Efficient Approach. Nord. J. Comput. 10(1): 21-28 (2003)

Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis: String Regularities with Don't Cares. Nord. J. Comput. 10(1): 40-51 (2003)

Bill Smyth, Chiou Peng Lam, Xin Chen, Valerie Maxville: Heuristics for Image Retrieval Using Spatial Configurations. DICTA 2003: 909-918

Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang: Computing the Minimum k-Cover of a String. Stringology 2003: 51-64

Yin Li, William F. Smyth: Computing the Cover Array in Linear Time. Algorithmica 32(1): 95-106 (2002)

Andrew Turpin, William F. Smyth: An Approach to Phrase Selection for Offline Data Compression. ACSC 2002: 267-273

Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth: Two-Pattern Strings. CPM 2002: 76-84

Frantisek Franek, William F. Smyth, Xiangdong Xiao: A Note on Crochemore's Repetitions Algorithm a Fast Space-Efficient Approach. Stringology 2002: 56-43

Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis: String Regularities with Don't Cares. Stringology 2002: 65-74

Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth: Approximate periods of strings. Theor. Comput. Sci. 262(1): 557-568 (2001)

Frantisek Franek, Ayse Karaman, W. F. Smyth: Repetitions in Sturmian strings. Theor. Comput. Sci. 249(2): 289-303 (2000)

W. F. Smyth: Repetitive perhaps, but certainly not boring. Theor. Comput. Sci. 249(2): 343-355 (2000)

Frantisek Franek, Weilin Lu, William F. Smyth: Repetitions in two-pattern strings. Stringology 2000: 32-48

Dennis Moore, William F. Smyth, D. Miller: Counting Distinct Strings. Algorithmica 23(1): 1-13 (1999)

Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth: Approximate Periods of Strings. CPM 1999: 123-133

Costas S. Iliopoulos, Dennis Moore, William F. Smyth: A Characterization of the Squares in a Fibonacci String. Theor. Comput. Sci. 172(1-2): 281-291 (1997)

Art M. Duval, William F. Smyth: Covering a Circular String with Substrings of Fixed Length. Int. J. Found. Comput. Sci. 7(1): 87-93 (1996)

Nora Hartsfield, W. F. Smyth: A family of sparse graphs of large sum number. Discrete Mathematics 141(1-3): 163-171 (1995)

Dennis Moore, William F. Smyth: A Correction to ``An Optimal Algorithm to Compute all the Covers of a String''. Inf. Process. Lett. 54(2): 101-103 (1995)

Dennis Moore, William F. Smyth: An Optimal Algorithm to Compute all the Covers of a String. Inf. Process. Lett. 50(5): 239-246 (1994)

Jacqueline W. Daykin, Costas S. Iliopoulos, William F. Smyth: Parallel RAM Algorithms for Factorizing Words. Theor. Comput. Sci. 127(1): 53-67 (1994)

Dennis Moore, William F. Smyth: Computing the Covers of a String in Linear Time. SODA 1994: 511-515

Peter Eades, Xuemin Lin, W. F. Smyth: A Fast and Effective Heuristic for the Feedback Arc Set Problem. Inf. Process. Lett. 47(6): 319-323 (1993)

Lou Caccetta, W. F. Smyth: Graphs of maximum diameter. Discrete Mathematics 102(2): 121-141 (1992)

Costas S. Iliopoulos, William F. Smyth: Optimal Algorithms for Computing the canonical form of a circular string. Theor. Comput. Sci. 92(1): 87-105 (1992)

W. F. Smyth: Mu-Balancing M-Way Search Trees. Comput. J. 34(5): 406-414 (1991)

K. A. Redish, W. F. Smyth: Closed form expressions for the iterated floor function. Discrete Mathematics 91(3): 317-321 (1990)

Costas S. Iliopoulos, William F. Smyth: PRAM Algorithms for Identifying Polygon Similarity. Optimal Algorithms 1989: 25-32

K. A. Redish, W. F. Smyth: Evaluating Measures of Program Quality. Comput. J. 30(3): 228-232 (1987)

K. A. Redish, W. F. Smyth: Program Style Analysis: A Natural By-Product of Program Compilation. Commun. ACM 29(2): 126-133 (1986)

W. F. Smyth, N. W. N. Jayasiri: The Encouragement of Effective Computer Use in Developing Countries. IFIP Congress 1980: 885-890

W. F. Smyth, Ilona Arany: Another algorithm for reducing bandwidth and profile of a sparse matrix. AFIPS National Computer Conference 1976: 987-994

W. F. Smyth, E. Radaceanu: A Storage Scheme for Hierarchic Structures. Comput. J. 17(2): 152-156 (1974)

W. F. Smyth, W. M. L. Benzi: An Algorithm for Finding the Diameter of a Graph. IFIP Congress 1974: 500-503

Ilona Arany, Lajos Szoda, W. F. Smyth: An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices. IFIP Congress (2) 1971: 1246-1250