Results 11 to 20 of about 679,088 (213)
Fully compressed suffix trees [PDF]
ACM Transactions on Algorithms, 2008 Suffix trees are by far the most important data structure in stringology, with a myriad of applications in fields like bioinformatics and information retrieval. Classical representations of suffix trees require Θ( n log n ) bits of space, for a string of size n .
Luís M. S. Russo +2 more
core +4 more sources
Efficient computation of absent words in genomic sequences [PDF]
BMC Bioinformatics, 2008 Background Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon usage, and so on.
Herold Julia +2 more
doaj +2 more sources
Converting suffix trees into factor/suffix oracles [PDF]
Journal of Discrete Algorithms, 2008 Several methods to compress suffix trees were defined, most of them with the aim of obtaining compact (that is, space economical) index structures. Besides this practical aspect, a compression method can reveal structural properties of the resulting data structure, allowing a better understanding of it and a better estimation of its performances.
Rusu, Irena
openaire +5 more sources
Weighted Ancestors in Suffix Trees [PDF]
, 2014 The classical, ubiquitous, predecessor problem is to construct a data structure for a set of integers that supports fast predecessor queries. Its generalization to weighted trees, a.k.a. the weighted ancestor problem, has been extensively explored and successfully reduced to the predecessor problem.
Gawrychowski, P. +2 more
openaire +5 more sources
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.
Brodnik, Andrej, Jekovec, Matevž
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
A tight upper bound on the size of the antidictionary of a binary string [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A tight upper bound of the size of the antidictionary of a binary string is presented. And it is shown that the size of the antidictionary of a binary sting is always smaller than or equal to that of its dictionary.
Hiroyoshi Morita, Takahiro Ota
doaj +1 more source
Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees
Algorithms, 2021 We present algorithms computing the non-overlapping Lempel–Ziv-77 factorization and the longest previous non-overlapping factor table within small space in linear or near-linear time with the help of modern suffix tree representations fitting into ...
Dominik Köppl
doaj +1 more source