Zobrazeno 1 - 10
of 159
pro vyhledávání: '"William F. Smyth"'
Publikováno v:
Theoretical Computer Science. 880:82-96
V-order is a total order on strings that determines an instance of Unique Maximal Factorization Families (UMFFs), a generalization of Lyndon words. The fundamental V-comparison of strings can be done in linear time and constant space. V-order has bee
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::351c444b89ab2c036c4c4781c16d7f2c
https://doi.org/10.1016/j.tcs.2021.06.004
https://doi.org/10.1016/j.tcs.2021.06.004
Publikováno v:
Alzamel, M, Iliopoulos, C S, Smyth, W F & Sung, W-K 2018, ' Off-line and
algorithms for closed string factorization ', Theoretical Computer Science . https://doi.org/10.1016/j.tcs.2018.10.033
algorithms for closed string factorization ', Theoretical Computer Science . https://doi.org/10.1016/j.tcs.2018.10.033
A string X = X [ 1 . . n ] , n > 1 , is said to be closed if it has a nonempty proper prefix that is also a suffix, but that otherwise occurs nowhere else in X ; for n = 1 , every X is closed. Closed strings were introduced by Fici in [1] as objects
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57921840135d6073d1cad1385c685879
https://doi.org/10.1016/j.tcs.2018.10.033
https://doi.org/10.1016/j.tcs.2018.10.033
Publikováno v:
2021 Reconciling Data Analytics, Automation, Privacy, and Security: A Big Data Challenge (RDAAPS).
Data analytics may conveniently be divided into four stages: preparation, preprocessing, analysis, and post-processing. Especially in the second and third of these, where the data is cleaned, filtered and analyzed, string processing algorithms are fu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a075d5306e7a2d4b1f354ec300455680
https://doi.org/10.1109/rdaaps48126.2021.9452004
https://doi.org/10.1109/rdaaps48126.2021.9452004
In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is "isomorphic" to a string whose entries all consist of a single letter, but which nevertheless may itself include entries
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6fc826f498dfd3eb04c1c8dd56ea41fc
Autor:
Neerja Mhaskar, William F. Smyth
Publikováno v:
Fundamenta Informaticae. 163:275-289
We study a central problem of string processing: the compact representation of a string by its frequently-occurring substrings. In this paper we propose an effective, easily-computed form of quasi-periodicity in strings, the frequency cover; that is,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b4d887a306199381f446cc0a870a6d8f
https://doi.org/10.3233/fi-2018-1744
https://doi.org/10.3233/fi-2018-1744
Autor:
William F. Smyth, Neerja Mhaskar
Publikováno v:
Journal of Discrete Algorithms. 51:26-38
In this paper we introduce the notion of an optimal cover. Let M denote the maximum number of positions in w covered by any repeating substring of w . Then a longest (shortest) optimal cover u is a longest (shortest) repeating substring of w that cov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::beda135638a202a2202f3c749c2a9f27
https://doi.org/10.1016/j.jda.2018.09.003
https://doi.org/10.1016/j.jda.2018.09.003
Publikováno v:
Theoretical Computer Science. 710:88-96
As discussed at length in Christodoulakis et al. (2015) [3] , there is a natural one-many correspondence between simple undirected graphs G with vertex set V = { 1 , 2 , … , n } and indeterminate strings x = x [ 1 . . n ] — that is, sequences of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab53f1de98a51e65566ce5d3e10baa5d
https://doi.org/10.1016/j.tcs.2017.02.016
https://doi.org/10.1016/j.tcs.2017.02.016
Publikováno v:
Theoretical Computer Science. 710:44-51
Given a string x = x [ 1 . . n ] on an ordered alphabet Σ of size σ, the Lyndon array λ = λ x [ 1 . . n ] of x is an array of positive integers such that λ [ i ] , 1 ≤ i ≤ n , is the length of the maximal Lyndon word over the ordering of Σ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ab1124d4cfd6f892b02d286d243e5d0
https://doi.org/10.1016/j.tcs.2017.04.008
https://doi.org/10.1016/j.tcs.2017.04.008
Publikováno v:
Journal of Discrete Algorithms. 42:23-34
A parameterized string (p-string) is a generalization of the traditional string over two alphabets: a constant alphabet and a parameter alphabet. A parameterized match (p-match) exists between two p-strings if the constants match exactly and if there
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0bf573485de0e5e82baf661b15d8cb14
https://doi.org/10.1016/j.jda.2016.11.002
https://doi.org/10.1016/j.jda.2016.11.002
Publikováno v:
AIMS Medical Science, Vol 4, Iss 3, Pp 261-273 (2017)
The prefix array was apparently first computed and used algorithmically in 1984, playing a pivotal role in an optimal algorithm to determine all the tandem repeats in a given (DNA or protein) sequence. However, it is especially since the turn of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5e325c86af1193dc7f0ba0f05fda24e
https://doi.org/10.3934/medsci.2017.3.261
https://doi.org/10.3934/medsci.2017.3.261