Results 11 to 20 of about 165 (120)
Engineering a Textbook Approach to Index Massive String Dictionaries [PDF]
, 2023 We study the problem of engineering space-time efficient indexes that support membership and lexicographic (rank) queries on very large static dictionaries of strings.
Rotundo, Mariagiovanna +2 more
core +1 more source
PATRICIA trie based time and memory optimization for fast network motif Search
The Indian Journal of Animal Sciences, 2017 Network motif search is useful in uncovering the important functional components of complex networks in biological, chemical, social and other domains. PATCOMP - a PARTICIA based novel approach for network motif search is proposed in this paper. The algorithm of PATCOMP takes benefit of memory compression and speed of PATRICIA trie to store the ...
null HIMANSHU +3 more
openaire +1 more source
Two-level massive string dictionaries [PDF]
We study the problem of engineering space-time efficient data structures that support membership and rank queries on very large static dictionaries of strings.
Ferragina P., Vinciguerra G., Rotundo M.
core +2 more sources
Impelementasi Struktur Data Patricia Tree pada Autocomplete Seacrh Box [PDF]
, 2011 ABSTRAKSI: Autocomplete pada search box berhubungan dengan data yang begitu besar. Sehingga ketika dilakukan pencarian frase/kata pada database terdapat kendala, dimana ketika semua frase harus ditelusuri untuk mendapatkan hasil dan terdapat hubungan ...
Zusni Adisya
core
Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems
, 2014 . The design of efficient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this paper we address the problem of longest prefix matching and present an efficient data structure called hashed Patricia trie ...
Christian Scheideler +1 more
core
Analysis of some trie parameters under probabilistic models
, 1992 A word is a string of symbols, finite or infinite in length, from a finite alphabet. Many algorithms in computer science, such as pattern matching, data compression, searching, hashing, and conflict resolution algorithms, require that a set of words be ...
Rais, Bonita Marie
core
Non-Blocking Data Structures Handling Multiple Changes Atomically [PDF]
, 2015 Here, we propose a new approach to design non-blocking algorithms that can apply multiple changes to a shared data structure atomically using Compare&Swap (CAS) instructions.
Shafiei, Niloufar
core
LIMITING DISTRIBUTION FOR THE DEPTH IN PATRICIA TRIES
, 2000 This paper establishes the limiting distribution for the depth of keys in a PATRICIA trie. A PATRICIA trie is a variation of the trie, a well-known tree structure, which is a frequently used data structure in many applications of computer science and ...
core
KATKA: A KRAKEN-like tool with k given at query time. [PDF]
Int Symp String Process Inf Retr, 2022 Gagie T, Kashgouli S, Langmead B.
europepmc +1 more source
Coriolis: enabling metagenomic classification on lightweight mobile devices. [PDF]
Bioinformatics, 2023 Mikalsen AJ, Zola J.
europepmc +1 more source