Zobrazeno 1 - 10
of 239
pro vyhledávání: '"String processing"'
Publikováno v:
Mathematics, Vol 11, Iss 22, p 4707 (2023)
We suggest a new technique for developing noisy tree data structures. We call it a “walking tree”. As applications of the technique we present a noisy Self-Balanced Binary Search Tree (we use a Red–Black tree as an implementation) and a noisy s
Externí odkaz:
https://doaj.org/article/5894a68f1e6d41cf8167aa6f21777b58
Publikováno v:
Mathematics, Vol 10, Iss 3, p 377 (2022)
We study algorithms for solving three problems on strings. These are sorting of n strings of length k, “the Most Frequent String Search Problem”, and “searching intersection of two sequences of strings”. We construct quantum algorithms that a
Externí odkaz:
https://doaj.org/article/6873653bc38649a480a64537447a5cf2
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.
Given an alphabet Σ of σ = |Σ| symbols, a degenerate (or indeterminate) string X is a sequence X = X[0],X[1]…, X[n-1] of n subsets of Σ. Since their introduction in the mid 70s, degenerate strings have been widely studied, with applications dri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4711af7c417da759a9e38bf31fa41468
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.
Publikováno v:
International Journal of Information Technology. 13:2227-2236
Correct and accurate retrieval of geographical information is still a challenging task as the contents on Internet are growing massively every day. Indexing geographical information from Web, so that even a naive user can get the required information
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9920ecee7b0a02e2378aa75996a6f7b4
https://doi.org/10.1007/s41870-021-00683-1
https://doi.org/10.1007/s41870-021-00683-1
Autor:
Artiom Alhazov
Publikováno v:
Computer Science Journal of Moldova, Vol 21, Iss 3(63), Pp 405-408 (2013)
Externí odkaz:
https://doaj.org/article/1977f6cd2d7c4a2b94efde02c79b757c
Autor:
Pengfei Xu, Jiaheng Lu
Publikováno v:
Proceedings of the VLDB Endowment. 12:1289-1302
A similarity join aims to find all similar pairs between two collections of records. Established algorithms utilise different similarity measures, either syntactic or semantic, to quantify the similarity between two records. However, when records are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6b1c8a35d8dd9e20235e4677118621c
https://doi.org/10.14778/3342263.3342268
https://doi.org/10.14778/3342263.3342268
Autor:
Puglisi, Simon J., Zhukova, Bella
Given a collection of strings, document listing refers to the problem of finding all the strings (or documents) where a given query string (or pattern) appears. Index data structures that support efficient document listing for string collections have
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ff2bb1e55d925587e5d0fe3f317acbf
http://hdl.handle.net/10138/355734
http://hdl.handle.net/10138/355734
The suffix tree — the compacted trie of all the suffixes of a string — is the most important and widely-used data structure in string processing. We consider a natural combinatorial question about suffix trees: for a string S of length n, how man
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::212345ecdd052679f3db510055926e25
http://hdl.handle.net/10138/341373
http://hdl.handle.net/10138/341373