A taxonomy of suffix array construction algorithms SJ Puglisi, WF Smyth, A Turpin ACM Computing Surveys 39 (1), 1-31, 2007 | 415 | 2007 |
Computing Patterns in Strings B Smyth Pearson Addison-Wesley, 2003 | 345 | 2003 |
A fast and effective heuristic for the feedback arc set problem P Eades, X Lin, WF Smyth Information processing letters 47 (6), 319-323, 1993 | 345 | 1993 |
Efficient token based clone detection with flexible tokenization HA Basit, SJ Puglisi, WF Smyth, A Turpin, S Jarzabek | 181 | 2007 |
A characterization of the squares in a Fibonacci string CS Iliopoulos, D Moore, WF Smyth Proc. CATS, 57-63, 1996 | 115 | 1996 |
A simple algorithm for computing the Lempel Ziv factorization M Crochemore, L Ilie, WF Smyth Data Compression Conference (DCC 2008), 482-488, 2008 | 102 | 2008 |
Computing the Cover Array in Linear Time Y Li, WF Smyth Algorithmica 32, 95-106, 2002 | 89* | 2002 |
A simple fast hybrid pattern-matching algorithm F Franek, CG Jennings, WF Smyth Journal of Discrete Algorithms 5 (4), 682-695, 2007 | 88 | 2007 |
How many runs can a string contain? SJ Puglisi, J Simpson, WF Smyth Theoretical Computer Science 401 (1-3), 165-171, 2008 | 78 | 2008 |
Lempel–Ziv factorization using less time & space G Chen, SJ Puglisi, WF Smyth Mathematics in Computer Science 1, 605-623, 2008 | 77 | 2008 |
An optimal algorithm to compute all the covers of a string D Moore, WF Smyth Information Processing Letters 50 (5), 239-246, 1994 | 73 | 1994 |
Fast pattern-matching on indeterminate strings J Holub, WF Smyth, S Wang Journal of Discrete Algorithms 6 (1), 37-50, 2008 | 70 | 2008 |
The maximum number of runs in a string F Franěk, RJ Simpson, WF Smyth 14th Australasian Workshop on Combinatorial Algorithms, 2003 | 69 | 2003 |
Verifying a border array in linear time F Franěk, W Lu, PJ Ryan, WF Smyth, Y Sun, L Yang 10th Australasian Workshop on Combinatorial Algorithms (AWOCA) 1999, 1999 | 67 | 1999 |
An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices. I Arany, L Szoda, WF Smyth IFIP Congress (2), 1246-1250, 1971 | 62 | 1971 |
A correction to “An optimal algorithm to compute all the covers of a string” D Moore, WF Smyth Information Processing Letters 54 (2), 101-103, 1995 | 61 | 1995 |
Finding patterns with variable length gaps or don’t cares MS Rahman, CS Iliopoulos, I Lee, M Mohamed, WF Smyth Computing and Combinatorics: 12th Annual International Conference, COCOON …, 2006 | 56 | 2006 |
Fast and practical algorithms for computing all the runs in a string G Chen, SJ Puglisi, WF Smyth Annual Symposium on Combinatorial Pattern Matching, 307-315, 2007 | 53 | 2007 |
Inverted files versus suffix arrays for locating patterns in primary memory SJ Puglisi, WF Smyth, A Turpin String Processing and Information Retrieval: 13th International Conference …, 2006 | 53 | 2006 |
Approximate periods of strings JS Sim, CS Iliopoulos, K Park, WF Smyth Theoretical Computer Science 262 (1-2), 557-568, 2001 | 52 | 2001 |