• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher:
    
    • Smyth, W.F. (38)
    • Franěk, F. (9)
    • Daykin, J.W. (8)
    • Puglisi, S.J. (7)
    • Iliopoulos, C.S. (6)
    • Rahman, M.S. (6)
    • Alatabbi, A. (5)
    • Turpin, A. (4)
    • Daykin, D.E. (3)
    • Mhaskar, N. (3)
    •   more
  • 
    Year
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Page: 1 2 Hits 1 – 20 of 38 1 Computation of the suffix array, Burrows-Wheeler transform and FM-index in V-order Smyth, W.F.; Daykin, J.W.; Mhaskar, N. In: Daykin, J.W., Mhaskar, N. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2021) Computation of the suffix array, Burrows-Wheeler transform and FM-index in V-order. Theoretical Computer Science, 880 . pp. 82-96. (2021) BASE Show details 2 A new approach to regular & indeterminate strings Louza, F.A.; Mhaskar, N.; Smyth, W.F. In: Louza, F.A., Mhaskar, N. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2021) A new approach to regular & indeterminate strings. Theoretical Computer Science, 854 . pp. 105-115. (2021) BASE Show details 3 Off-line and on-line algorithms for closed string factorization Alzamel, M.; Iliopoulos, C.S.; Smyth, W.F.... In: Alzamel, M., Iliopoulos, C.S., Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> and Sung, W-K (2018) Off-line and on-line algorithms for closed string factorization. Theoretical Computer Science, 792 . pp. 12-19. (2018) BASE Show details 4 Applications of V-Order: Suffix arrays, the Burrows-Wheeler transform & the FM-index Daykin, J.W.; Smyth, W.F.; Rahman, M.S.... In: Alatabbi, A., Daykin, J.W., Mhaskar, N., Rahman, M.S. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2018) Applications of V-Order: Suffix arrays, the Burrows-Wheeler transform & the FM-index. Lecture Notes in Computer Science, 11355 . pp. 329-338. (2018) BASE Show details 5 On baier's sort of maximal Lyndon substrings Franěk, F.; Liut, M.; Smyth, W.F. 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 6 Algorithms to compute the lyndon array Franěk, F.; Sohidull Islam, A.S.M.; Rahman, M.S.... 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 7 String comparison in V-Order: New lexicographic properties & On-line applications Rahman, M.S.; Alatabbi, A.; Daykin, J.W.... In: Alatabbi, A., Daykin, J.W., Rahman, M.S. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2015) String comparison in V-Order: New lexicographic properties & On-line applications. Unpublished Publication . (2015) BASE Show details 8 Enhanced covers of regular & indeterminate strings using prefix tables Alatabbi, A.; Sohidull Islam, A.S.; Rahman, M.S.... In: Alatabbi, A., Sohidull Islam, A.S., Rahman, M.S., Simpson, J. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2015) Enhanced covers of regular & indeterminate strings using prefix tables. Unpublished Publication . (2015) BASE Show details 9 Simple Linear Comparison of Strings in V-order* Alatabbi, A.; Daykin, J.W.; Rahman, M.S.... In: Alatabbi, A., Daykin, J.W., Rahman, M.S. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2015) Simple Linear Comparison of Strings in V-order*. Fundamenta Informaticae, 139 (2). pp. 115-126. (2015) BASE Show details 10 A bijective variant of the Burrows–Wheeler Transform using V-order Daykin, J.W.; Smyth, W.F. In: Daykin, J.W. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2014) A bijective variant of the Burrows–Wheeler Transform using V-order. Theoretical Computer Science, 531 . pp. 77-89. (2014) BASE Show details 11 Inferring an indeterminate string from a prefix graph Alatabbi, A.; Sohel Rahman, M.; Smyth, W.F. In: Alatabbi, A., Sohel Rahman, M. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2014) Inferring an indeterminate string from a prefix graph. Journal of Discrete Algorithms, 32 . pp. 6-13. (2014) BASE Show details 12 Enhanced string covering Flouri, T.; Iliopoulos, C.S.; Kociumaka, T.... In: Flouri, T., Iliopoulos, C.S., Kociumaka, T., Pissis, S.P., Puglisi, S.J., Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> and Tyczyński, W. (2013) Enhanced string covering. Theoretical Computer Science, 506 . pp. 102-114. (2013) BASE Show details 13 A linear partitioning algorithm for Hybrid Lyndons using -order Daykin, D.E.; Daykin, J.W.; Smyth, W.F. In: Daykin, D.E., Daykin, J.W. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2013) A linear partitioning algorithm for Hybrid Lyndons using -order. Theoretical Computer Science, 483 . pp. 149-161. (2013) BASE Show details 14 New complexity results for the k-covers problem Iliopoulos, Costas S.; Mohamed, Manal; Smyth, W.F. In: Information sciences. - New York, NY : Elsevier Science Inc. 181 (2011) 12, 2571-2575 OLC Linguistik Show details 15 String comparison and Lyndon-like factorization using V-order in linear time Daykin, D.E.; Daykin, J.W.; Smyth, W.F. In: Daykin, D.E., Daykin, J.W. and Smyth, W.F. (2011) String comparison and Lyndon-like factorization using V-order in linear time. Lecture Notes in Computer Science, 6661 . pp. 65-76. (2011) BASE Show details 16 Combinatorics of unique maximal factorization families (UMFFs) Daykin, D.E.; Daykin, J.W.; Smyth, W.F. In: Daykin, D.E., Daykin, J.W. and Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> (2009) Combinatorics of unique maximal factorization families (UMFFs). Fundamenta Informaticae, 97 (3). pp. 295-309. (2009) BASE Show details 17 Faster algorithms for computing maximal multirepeats in multiple sequences Ilopoulos, C.S.; Smyth, W.F.; Yusufu, M. In: Ilopoulos, C.S., Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> and Yusufu, M. (2009) Faster algorithms for computing maximal multirepeats in multiple sequences. Fundamenta Informaticae, 97 (3). pp. 311-320. (2009) BASE Show details 18 A new approach to the periodicity lemma on strings with holes Smyth, W.F.; Wang, Shu In: Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> and Wang, Shu (2009) A new approach to the periodicity lemma on strings with holes. Theoretical Computer Science, 410 (43). pp. 4295-4302. (2009) BASE Show details 19 Fast optimal algorithms for computing all the repeats in a string Puglisi, S.J.; Smyth, W.F.; Yusufu, M. In: Puglisi, S.J., Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> and Yusufu, M. (2008) Fast optimal algorithms for computing all the repeats in a string. In: Prague Stringology Conference 2008, 1 - 3 September 2008, Czech Technical University, Prague (2008) BASE Show details 20 A taxonomy of suffix array construction algorithms Puglisi, S.J.; Smyth, W.F.; Turpin, A.H. In: Puglisi, S.J., Smyth, W.F. <https://researchrepository.murdoch.edu.au/view/author/Smyth, William.html> and Turpin, A.H. (2007) A taxonomy of suffix array construction algorithms. ACM Computing Surveys, 39 (2). (2007) BASE Show details Page: 1 2

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 1 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 37 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0