Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Noa Lewenstein"'
Publikováno v:
Theoretical Computer Science. 656:146-159
In this paper we investigate jumbled (Abelian) versions of three classical strings problems. In all these problems we assume the input string S 1 . . n is given in its run-length format S ' 1 . . r .The Jumbled Indexing problem is the problem of inde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec6dccfea124e5c5a5cf5a2d27b9bc47
https://doi.org/10.1016/j.tcs.2016.04.030
https://doi.org/10.1016/j.tcs.2016.04.030
Publikováno v:
Theoretical Computer Science. 638:27-32
Scaled matching and permutation matching are two well known paradigms in the domain of pattern matching. Scaled matching refers to finding an occurrence of a pattern which is enlarged proportionally by some scale k within a larger text. Permutation m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3e46fd4af054f7804ef94579ac6bcdc
https://doi.org/10.1016/j.tcs.2016.02.036
https://doi.org/10.1016/j.tcs.2016.02.036
Publikováno v:
Theoretical Computer Science. 533:26-36
The problem of finding the period of a vector V is central to many applications. Let V′ be a periodic vector closest to V under some metric. We seek this V′, or more precisely we seek the smallest period that generates V′. In this paper we cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bbaae70acfaef2796d71fde9dc504c10
https://doi.org/10.1016/j.tcs.2014.03.019
https://doi.org/10.1016/j.tcs.2014.03.019
Autor:
Amihood Amir, Avivit Levy, Gad M. Landau, Estrella Eisenberg, Alberto Apostolico, Noa Lewenstein
Publikováno v:
Theoretical computer science (Berl. West) 525 (2014): 60–67.
info:cnr-pdr/source/autori:Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein/titolo:Detecting approximate periodic patterns/doi:/rivista:Theoretical computer science (Berl. West)/anno:2014/pagina_da:60/pagina_a:67/intervallo_pagine:60–67/volume:525
info:cnr-pdr/source/autori:Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein/titolo:Detecting approximate periodic patterns/doi:/rivista:Theoretical computer science (Berl. West)/anno:2014/pagina_da:60/pagina_a:67/intervallo_pagine:60–67/volume:525
Given @e@?[0,1), the @e-Relative Error Periodic Pattern Problem (REPP) is the following: INPUT: An n-long sequence S of numbers s"i@?N in increasing order. OUTPUT: The longest @e-relative error periodic pattern, i.e., the longest subsequence s"i"""1,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b694b1d11fb8f2c61e51fb39f9025649
https://doi.org/10.1016/j.tcs.2013.05.001
https://doi.org/10.1016/j.tcs.2013.05.001
Publikováno v:
ACM Transactions on Algorithms. 7:1-15
In the k -matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of them, and any k aligned matching characters if there are more than k o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ed76e826f5e56f760a11fd31222035a
https://doi.org/10.1145/1921659.1921670
https://doi.org/10.1145/1921659.1921670
Autor:
Dmitry Keselman, Noa Lewenstein, Michael Rodeh, Amihood Amir, Gad M. Landau, Moshe Lewenstein
Publikováno v:
Journal of Algorithms. 37:309-325
The indexing problem is where a text is preprocessed and subsequent queries of the form “Find all occurrences of pattern P in the text” are answered in time proportional to the length of the query and the number of occurrences. In the dictionary
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3185e9ee96f2b01d95322f33599fcd4
https://doi.org/10.1006/jagm.2000.1104
https://doi.org/10.1006/jagm.2000.1104
Publikováno v:
Journal of Algorithms. 35:82-99
The importance of hypertext has been steadily growing over the past decade. The Internet and other information systems use hypertext format, with data organized associatively rather than sequentially or relationally. A myriad of textual problems have
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54a78ede7ecf859b58fcd20e2645ddb1
https://doi.org/10.1006/jagm.1999.1063
https://doi.org/10.1006/jagm.1999.1063
Publikováno v:
Information Processing Letters. 68:125-132
Let a text string T of n symbols and a pattern string P of m symbols from alphabet ∑ be given. A swapped version T′ of T is a length n string derived from T by a series of local swaps (i.e., t′l ← tl + 1 and t′l + 1 ← tl) where each eleme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5d018d47e0db1925d638d8049d2e9bd
https://doi.org/10.1016/s0020-0190(98)00151-3
https://doi.org/10.1016/s0020-0190(98)00151-3
Publikováno v:
String Processing and Information Retrieval ISBN: 9783319119175
SPIRE
SPIRE
Jumbled Indexing, the problem of indexing a text for histogram queries, has been of much interest lately. In this paper we consider jumbled indexing for run-length encoded texts. We refute a former conjecture and show an algorithm for general sized a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55ccef79e9dd9030a65d7f6c9e0bd0b5
https://doi.org/10.1007/978-3-319-11918-2_5
https://doi.org/10.1007/978-3-319-11918-2_5
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642453205
Language, Culture, Computation (1)
Language, Culture, Computation (1)
The idea of hypertext has been successfully used in Jewish literature. Its importance has been steadily growing over the last two decades. Internet and other information systems use hypertext format, with data organized associatively rather than sequ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d28731b7f07f0d78d00945b93fb3a6db
https://doi.org/10.1007/978-3-642-45321-2_15
https://doi.org/10.1007/978-3-642-45321-2_15