| 1 |
On baier's sort of maximal Lyndon substrings
|
|
|
|
In: Franěk, F., Liut, M. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2018) On baier's sort of maximal Lyndon substrings. In: Prague Stringology Conference (PSC) 2018, 27 - 28 August 2018, Czech Technical University, Prague (2018)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
Algorithms to compute the lyndon array
|
|
|
|
In: Franěk, F., Sohidull Islam, A.S.M., Rahman, M.S. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2016) Algorithms to compute the lyndon array. In: Prague Stringology Conference (PSC) 2016, 29 - 31 August 2016, Prague, Czech Republic (2016)
|
|
BASE
|
|
Show details
|
|
|
| 3 |
Reconstructing a suffix array
|
|
|
|
In: Franěk, F. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2006) Reconstructing a suffix array. International Journal of Foundations of Computer Science, 17 (06). pp. 1281-1295. (2006)
|
|
BASE
|
|
Show details
|
|
|
| 4 |
Reconstructing a suffix array
|
|
|
|
In: Franěk, F. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2005) Reconstructing a suffix array. In: The Prague Stringology Conference 2005, 29 - 31 August 2005, Czech Technical University, Prague (2005)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
Sorting suffixes of two-pattern strings
|
|
|
|
In: Franěk, F. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2005) Sorting suffixes of two-pattern strings. International Journal of Foundations of Computer Science, 16 (6). pp. 1135-1144. (2005)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
Sorting suffixes of two-pattern strings
|
|
|
|
In: Franěk, F. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2004) Sorting suffixes of two-pattern strings. In: Prague Stringology Conference 2004, 30 August - 1 September 2004, Czech Technical University, Prague (2004)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
Computing quasi suffix arrays
|
|
|
|
In: Franěk, F., Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> and Xiao, X. (2003) Computing quasi suffix arrays. Journal of Automata, Languages and Combinatorics, 8 (4). pp. 593-606. (2003)
|
|
BASE
|
|
Show details
|
|
|
| 9 |
Computing all repeats using suffix arrays
|
|
|
|
In: Franěk, F., Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> and Tang, Y. (2003) Computing all repeats using suffix arrays. Journal of Automata, Languages and Combinatorics, 8 (4). pp. 579-591. (2003)
|
|
BASE
|
|
Show details
|
|
|
| 10 |
Verifying a border array in linear time
|
|
|
|
In: Franěk, F., Lu, W., Ryan, P.J., Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html>, Sun, Y. and Yang, L. (1999) Verifying a border array in linear time. In: 10th Australasian Workshop on Combinatorial Algorithms (AWOCA) 1999, Perth, Western Australia (1999)
|
|
BASE
|
|
Show details
|
|
|
|
|
