Results 121 to 130 of about 679,088 (213)

An implementation of dynamic fully compressed suffix trees [PDF]

, 2010
Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia InformáticaThis dissertation studies and implements a dynamic fully compressed suffix tree.
Figueiredo, Miguel Filipe da Silva
core  

Activity: Suffix Trees

Understand the concept of "suffix trees" by studying a Bach fugue (BWV ...

core  

Efficient Implementation of Lazy Suffix Trees

, 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  

A frequent max substring technique for Thai text indexing [PDF]

, 2011
This research details the development of a novel methodology, called the frequent max substring technique, for extracting indexing terms and constructing an index for Thai text documents.
Chumwatana, Todsanai
core  

DRIMust: a web server for discovering rank imbalanced motifs using suffix trees. [PDF]

Nucleic Acids Res, 2013
Leibovich L, Paz I, Yakhini Z, Mandel-Gutfreund Y.   +3 more
europepmc   +1 more source

Abstract Distributed Suffix Trees ⋆

, 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  

Suffix Trees Construction and Their Use in Bioinformatics

, 2011
This work discusses problems of suffix trees implementation and their use in bioinformatics. There are given different sorts of algorithms for building suffix trees in this work.
Hlaváček, Pavel
core  

Reducing the Space Requirement of Suffix Trees

, 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  

Augmenting Suffix Trees, with Applications

, 1998
. Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role.
Yossi Matias, S. Muthukrishnan, Jacob Ziv, Süleyman Cenk Sahinalp   +3 more
core  

Suffixient Arrays: A New Efficient Suffix Array Compression Technique. [PDF]

Theory Comput Syst
Cenzato D, Depuydt L, Gagie T, Kim SH, Manzini G, Olivares F, Prezza N.   +6 more
europepmc   +1 more source