Results 71 to 80 of about 58,956 (207)
Pendekatan MapReduce untuk Implementasi Suffix Tree pada AutoComplete Produk dengan Metodologi Agile
JuTISI (Jurnal Teknik Informatika dan Sistem Informasi), 2019 With the development of technology and communication nowadays, it encourages everyone to get everything quickly, easily and precisely, especially in the world of e-commerce which is increasingly widespread and needed by almost everyone.
Yosef Ariyanto Irawan +5 more
doaj +1 more source
Faster suffix tree construction with missing suffix links [PDF]
Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000 Summary: We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees for two-dimensional arrays. These trees also have the property that the node degrees may be large.
Cole, Richard, Hariharan, Ramesh
openaire +3 more sources
Journal of Discrete Algorithms, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Approximate String Matching with Compressed Indexes
Algorithms, 2009 A compressed full-text self-index for a text T is a data structure requiring reduced space and able to search for patterns P in T. It can also reproduce any substring of T, thus actually replacing T. Despite the recent explosion of interest on compressed
Pedro Morales +3 more
doaj +1 more source
New Algorithms for Position Heaps
, 2013 We present several results about position heaps, a relatively new alternative to suffix trees and suffix arrays. First, we show that, if we limit the maximum length of patterns to be sought, then we can also limit the height of the heap and reduce the ...
A. Ehrenfeucht +7 more
core +1 more source
Loanwords and Linguistic Phylogenetics: *pelek̑u‐ ‘axe’ and *(H)a(i̯)g̑‐ ‘goat’1
Transactions of the Philological Society, Volume 123, Issue 1, Page 116-136, March 2025.Abstract This paper assesses the role of borrowings in two different approaches to linguistic phylogenetics: Traditional qualitative analyses of lexemes, and quantitative computational analysis of cognacy. It problematises the assumption that loanwords can be excluded altogether from datasets of lexical cognacy.
Simon Poulsen
wiley +1 more source
Transactions of the Philological Society, EarlyView.Abstract Based on an analysis of the Old Literary Tibetan corpus—a corpus of the oldest documented Tibetic language—the present study provides evidence that literary Tibetan v3 verb stems (commonly termed ‘future’) initially encoded passive voice. New arguments put forward in this article range from Trans‐Himalayan nominal morphology to early Tibetan ...
Joanna Bialek
wiley +1 more source
InformationLeveraging Data Processing Units (DPUs) deployed at network interfaces, the DPU-accelerated Intrusion Detection System (IDS) enables microsecond-latency initial traffic inspection through hardware offloading.
Rui Zhang +5 more
doaj +1 more source
Error Tree: A Tree Structure for Hamming & Edit Distances & Wildcards Matching
, 2015 Error Tree is a novel tree structure that is mainly oriented to solve the approximate pattern matching problems, Hamming and edit distances, as well as the wildcards matching problem.
Al-Okaily, Anas
core +1 more source
On updating suffix tree labels
Theoretical Computer Science, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
FERRAGINA, PAOLO +2 more
openaire +3 more sources