Results 111 to 120 of about 679,088 (213)

Efficient implementation of lazy suffix trees

, 1999
Giegerich R, Kurtz S, Stoye J. Efficient implementation of lazy suffix trees. In: Algorithm Engineering. 3rd International Workshop, WAE’99 London, UK, July 19–21, 1999 Proceedings. LNCS. Vol 1668. 1999: 30-42.We present an efficient implementation of a
Jens Stoye, Stefan Kurtz, Stoye, Jens ; https://orcid.org/, Robert Giegerich, Giegerich, Robert, Kurtz, Stefan   +5 more
core   +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, Na, J C, Iliopoulos, Costas S., APOSTOLICO, ALBERTO, Park, Kunsoo, Na, Joong Chae, J. C. NA, Apostolico, A, C. ILIOPOULOS, K. PARK, Park, K   +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  

Suffix vector : space- and time-efficient alternative to suffix trees

, 2002
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its space requirement.
Zaslavsky, Arkady, Schmidt, Heinz,, Monostori, Krisztián,   +2 more
core   +1 more source

Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees

Transactions of the Association for Computational Linguistics, 2021
Ehsan Shareghi, Matthias Petri, Gholamreza Haffari, Trevor Cohn   +3 more
doaj   +1 more source

On-line linear-time construction of word suffix trees

, 2006
. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression.
Masayuki Takeda, Shunsuke Inenaga
core   +1 more source

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   +4 more sources

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  

Statistical signature of subtle behavioral changes in large-scale assays.

PLoS Computational Biology
The central nervous system can generate various behaviors, including motor responses, which we can observe through video recordings. Recent advances in gene manipulation, automated behavioral acquisition at scale, and machine learning enable us to ...
Alexandre Blanc, François Laurent, Alex Barbier-Chebbah, Hugues Van Assel, Benjamin T Cocanougher, Benjamin M W Jones, Peter Hague, Marta Zlatic, Rayan Chikhi, Christian L Vestergaard, Tihana Jovanic, Jean-Baptiste Masson, Chloé Barré   +12 more
doaj   +1 more source

The Suffix Tree Data Structure: Theory and Practice

openLa tesi affronta lo studio delle strutture dati per l’indicizzazione di stringhe, concentrandosi sui Suffix Tree e, in particolarmente sulla sua variante compressa: Compressed Suffix Tree.
YE, XIAOJUN
core