Zobrazeno 1 - 10
of 97
pro vyhledávání: '"Levy, Avivit"'
Similarity measures play a central role in various data science application domains for a wide assortment of tasks. This guide describes a comprehensive set of prevalent similarity measures to serve both non-experts and professional. Non-experts that
Externí odkaz:
http://arxiv.org/abs/2408.07706
Publikováno v:
In Theoretical Computer Science 12 October 2024 1012
Publikováno v:
In Ecological Informatics September 2024 82
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We examine the complexity of the online Dictionary Matching with One Gap Problem (DMOG) which is the following. Preprocess a dictionary $D$ of $d$ patterns, where each pattern contains a special gap symbol that can match any string, so that given a t
Externí odkaz:
http://arxiv.org/abs/1503.07563
Publikováno v:
In Information and Computation December 2020 275
The dictionary matching with gaps problem is to preprocess a dictionary $D$ of $d$ gapped patterns $P_1,\ldots,P_d$ over alphabet $\Sigma$, where each gapped pattern $P_i$ is a sequence of subpatterns separated by bounded sequences of don't cares. Th
Externí odkaz:
http://arxiv.org/abs/1408.2350
In this paper we define a new problem, motivated by computational biology, $LCSk$ aiming at finding the maximal number of $k$ length $substrings$, matching in both input strings while preserving their order of appearance. The traditional LCS definiti
Externí odkaz:
http://arxiv.org/abs/1402.2097
Many problems in bioinformatics are about finding strings that approximately represent a collection of given strings. We look at more general problems where some input strings can be classified as outliers. The Close to Most Strings problem is, given
Externí odkaz:
http://arxiv.org/abs/1202.2820
Publikováno v:
In Theoretical Computer Science 19 July 2015 589:34-46