Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Bidirectional String Anchors for Improved Text Indexing and Top-K Similarity Search

Autor: Loukides, Grigorios, Pissis, Solon P., Sweering, Michelle

Publikováno v: Loukidis, G, Pissis, S & Sweering, M 2023, ' Bidirectional String Anchors for Improved Text Indexing and Top-K Similarity Search ', IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, pp. 1-18 . https://doi.org/10.1109/TKDE.2022.3231780
IEEE Transactions on Knowledge and Data Engineering

The minimizers sampling mechanism is a popular mechanism for string sampling. However, minimizers sampling mechanisms lack good guarantees on the expected size of their samples for different combinations of their input parameters. Furthermore, indexe

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0dc76ff055ae714ddccbcad2a6e59b22
https://kclpure.kcl.ac.uk/ws/files/195931388/Bidirectional_String_Anchors_4.pdf

ELASTIC-DEGENERATE STRING MATCHING VIA FAST MATRIX MULTIPLICATION

Autor: Giulia Bernardini, Paweł Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone

Publikováno v: SIAM Journal on Computing
SIAM Journal on Computing, 2022, 51 (3), pp.549-576. ⟨10.1137/20M1368033⟩
NARCIS
Hyper Article en Ligne
Datacite
ORCID
INRIA a CCSD electronic archive server
arXiv.org e-Print Archive
Vrije Universiteit Amsterdam (VU Amsterdam)-Institutional Repository
Bernardini, G, Gawrychowski, P, Pisanti, N, Pissis, S P & Rosone, G 2022, ' ELASTIC-DEGENERATE STRING MATCHING VIA FAST MATRIX MULTIPLICATION ', SIAM Journal on Computing, vol. 51, no. 3, pp. 549-576 . https://doi.org/10.1137/20M1368033
SIAM Journal on Computing, 51(3), 549-576
SIAM Journal on Computing, 51(3), 549-576. Society for Industrial and Applied Mathematics Publications
Bernardini, G, Gawrychowski, P, Pisanti, N, Pissis, S P & Rosone, G 2022, ' Elastic-Degenerate String Matching via Fast Matrix Multiplication ', SIAM Journal on Computing, vol. 51, no. 3, pp. 549-576 . https://doi.org/10.1137/20M1368033

An elastic-degenerate (ED) string is a sequence of $n$ sets of strings of total length $N$, which was recently proposed to model a set of similar sequences. The ED string matching (EDSM) problem is to find all occurrences of a pattern of length $m$ i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e05b6ad51675d74ee543feddedca5fc3
https://ir.cwi.nl/pub/32732

Computing Maximal Lyndon Substrings of a String

Autor: Frantisek Franek, Michael Liut

Publikováno v: Algorithms, Vol 13, Iss 11, p 294 (2020)

There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maxima

Externí odkaz: https://doaj.org/article/67de28ce3d494ed3a8b54b47a6e14723