Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Neerja Mhaskar"'
Publikováno v:
Journal of Computational Biology. 30:149-160
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3236e37b9dff189e64c8dfea36f84a60
https://doi.org/10.1089/cmb.2021.0520
https://doi.org/10.1089/cmb.2021.0520
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
Autor:
Neerja Mhaskar, Michael Soltys
Publikováno v:
Scopus-Elsevier
A new formal framework for Stringology is proposed, which consists of a three-sorted logical theory S designed to capture the combinatorial reasoning about finite strings. We propose a language L S for expressing assertions about strings, and study i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84726fa0c43ffc34ced54b3ccc229171
https://doi.org/10.1016/j.dam.2018.03.010
https://doi.org/10.1016/j.dam.2018.03.010
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ffb6be6dfbc426b7cee5db63311359e
https://doi.org/10.2139/ssrn.4302961
https://doi.org/10.2139/ssrn.4302961
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:
Information Processing Letters. 168:106097
In this paper, we introduce the longest previous overlapping factor array of a string – a variant of the longest previous factor array. We show that it can be computed in linear time in the length of the input string, via a reduction to the Max-var
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea36faacf2d3f2548686d9329bcd6729
https://doi.org/10.1016/j.ipl.2021.106097
https://doi.org/10.1016/j.ipl.2021.106097
Publikováno v:
Computers & Security. 103:102162
Network segmentation or compartmentalization, and layered protection are two strategies that are critical in building a secure network. In the literature, layered protection has been formalized and termed as the Defence in Depth (DD) strategy. Howeve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2fe2be613eea507d4f6083ffdaf49b55
https://doi.org/10.1016/j.cose.2020.102162
https://doi.org/10.1016/j.cose.2020.102162