Results 1 to 10 of about 3,800 (211)
Practical Compressed Suffix Trees [PDF]
Algorithms, 2013 The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations for
Gonzalo Navarro +2 more
doaj +7 more sources
Distributed suffix trees [PDF]
Journal of Discrete Algorithms, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raphaël Clifford
exaly +4 more sources
Replacing suffix trees with enhanced suffix arrays
Journal of Discrete Algorithms, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan Kurtz, Enno Ohlebusch
exaly +2 more sources
A suffix tree or not a suffix tree? [PDF]
Journal of Discrete Algorithms, 2015 Full version.
Starikovskaya, Tatiana A. +1 more
openaire +3 more sources
Reversed Lempel–Ziv Factorization with Suffix Trees
Algorithms, 2021 We present linear-time algorithms computing the reversed Lempel–Ziv factorization [Kolpakov and Kucherov, TCS’09] within the space bounds of two different suffix tree representations.
Dominik Köppl
doaj +1 more source
Analysis of the average depth in a suffix tree under a Markov model [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In this report, we prove that under a Markovian model of order one, the average depth of suffix trees of index n is asymptotically similar to the average depth of tries (a.k.a. digital trees) built on n independent strings.
Julien Fayolle, Mark Daniel Ward
doaj +1 more source
Intent Arabic text categorisation based on different machine learning and term frequency
IET Networks, EarlyView., 2022 Abstract The complexity of Internet network configurations has made managing networks a complicated undertaking. Intent‐Based Networking (IBN) is a potential solution to this issue. In contrast to conventional networks, where a concrete description of the settings typically conveys a network administrator's goal kept on each device, an administrator's ...
Mohammad Fadhil Mahdi +1 more
wiley +1 more source
Average profiles, from tries to suffix-trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We build upon previous work of Fayolle (2004) and Park and Szpankowski (2005) to study asymptotically the average internal profile of tries and of suffix-trees. The binary keys and the strings are built from a Bernoulli source $(p,q)$.
Pierre Nicodème
doaj +1 more source
Algorithms, 2018 We consider a sliding window W over a stream of characters from some alphabet of constant size. We want to look up a pattern in the current sliding window content and obtain all positions of the matches. We present an indexed version of the sliding window, based on a suffix tree.
Andrej Brodnik, Matevž Jekovec
openaire +3 more sources
Analysis of the multiplicity matching parameter in suffix trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In a suffix tree, the multiplicity matching parameter (MMP) $M_n$ is the number of leaves in the subtree rooted at the branching point of the $(n+1)$st insertion.
Mark Daniel Ward, Wojciech Szpankowski
doaj +1 more source