Sciweavers

773 search results - page 4 / 155
» Suffix Trees on Words
Sort
View
ML
2006
ACM
132views Machine Learning» more  ML 2006»
13 years 7 months ago
A suffix tree approach to anti-spam email filtering
We present an approach to email filtering based on the suffix tree data structure. A method for the scoring of emails using the suffix tree is developed and a number of scoring and...
Rajesh Pampapathi, Boris Mirkin, Mark Levene
IJFCS
2006
108views more  IJFCS 2006»
13 years 7 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth
ICDAR
2011
IEEE
12 years 6 months ago
A Method for Removing Inflectional Suffixes in Word Spotting of Mongolian Kanjur
Abstract—According to characteristics of Mongolian wordformation, a method for removing inflectional suffixes from word images of the Mongolian Kanjur is proposed in this paper. ...
Hongxi Wei, Guanglai Gao, Yulai Bao
ICDE
2004
IEEE
139views Database» more  ICDE 2004»
14 years 8 months ago
Engineering a Fast Online Persistent Suffix Tree Construction
Online persistent suffix tree construction has been considered impractical due to its excessive I/O costs. However, these prior studies have not taken into account the effects of ...
Srikanta J. Bedathur, Jayant R. Haritsa
CIKM
2009
Springer
13 years 11 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...