Results 111 to 120 of about 3,800 (211)
PLoS Computational Biology, 2018 The 3D structure of chromatin plays a key role in genome function, including gene expression, DNA replication, chromosome segregation, and DNA repair.
Carl Barton +7 more
doaj +1 more source
Truncated Suffix Trees and their Applications to Data Compression [PDF]
, 2003 The suffix tree is a fundamental data structure in the area of string algorithms and it has been used in many applications including data compression.
Iliopoulos, C S +10 more
core +1 more source
An estimation of the size of non-vompact suffix trees [PDF]
, 2016 A suffix tree is a data structure used mainly for pattern matching. It is known that the space complexity of simple suffix trees is quadratic in the length of the string.
Vásárhelyi Bálint
core
Parallel Query in the Suffix Tree
CoRR, 2015 Given the query string of length $m$, we explore a parallel query in a static suffix tree based data structure for $p \ll n$, where $p$ is the number of processors and $n$ is the length of the text. We present three results on CREW PRAM. The parallel query in the suffix trie requires $O(m + p)$ work, $O(m/p + \lg p)$ time and $O(n^2)$ space in the ...
Matevz Jekovec, Andrej Brodnik
openaire +2 more sources
Efficient Implementation of Lazy Suffix Trees [PDF]
, 2008 . We present an efficient implementation of a write-only topdown construction for suffix trees. Our implementation is based on a new, space-efficient representation of suffix trees which requires only 12 bytes per input character in the worst case, and 8:
core
Abstract Distributed Suffix Trees ⋆ [PDF]
, 2008 We present a new variant of the suffix tree called a distributed suffix tree (DST) which allows for much larger databases of strings to be handled efficiently. The method is based on a new linear time construction algorithm for subtrees of a suffix tree.
Raphaël Clifford
core
Reducing the Space Requirement of Suffix Trees [PDF]
, 1998 We show that suffix trees store various kinds of redundant information. We exploit these redundancies to obtain more space efficient representations. The most space efficient of our representations requires 20 bytes per input character in the worst case,
Stefan Kurtz
core
Compressed suffix trees for repetitive collections based on block trees [PDF]
, 2019 Tesis para optar al grado de Magíster en Ciencias, Mención ComputaciónMemoria para optar al título de Ingeniero Civil en ComputaciónThe Block Tree is a recently proposed data structure representing a sequence T of length n in space bounded by the number ...
Cáceres Reyes, Manuel Ariel
core
The suffix tree of a tree and minimizing sequential transducers
Theoretical Computer Science, 1995 This paper gives a linear-time algorithm for the construction of the<br />suffix tree of a tree. The suffix tree of a tree is used to obtain an efficient<br />algorithm for the minimization of sequential transducers.
openaire +3 more sources