( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A taxonomy of suffix array construction algorithms.

, , и . Stringology, стр. 1-30. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

William F Meinecke

Ben Smyth

Maureen Smyth

Padhraic Smyth

Michael Smyth

 

Другие публикации лиц с тем же именем

Minimum Unique Substrings and Maximum Repeats., и . Fundam. Informaticae, 110 (1-4): 183-195 (2011)Computing the Cover Array in Linear Time., и . Algorithmica, 32 (1): 95-106 (2002)Simple KMP Pattern-Matching on Indeterminate Strings., и . Stringology, стр. 125-133. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2020)On Baier's Sort of Maximal Lyndon Substrings., , и . Stringology, стр. 63-78. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2018)Two Squares Canonical Factorization., , и . Stringology, стр. 52-58. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2014)Repetitions in two-pattern strings., , и . Stringology, стр. 32-48. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2000)An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings., , и . Stringology, стр. 95-107. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2008)Improved Practical Algorithms to Compute Maximal Covers., , и . PSC, стр. 30-41. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2023)Algorithms to Compute the Lyndon Array., , , и . Stringology, стр. 172-184. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2016)New and Efficient Approaches to the Quasiperiodic Characterisation of a String., , , , , , и . Stringology, стр. 75-88. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2012)