Sciweavers

773 search results - page 6 / 155
» Suffix Trees on Words
Sort
View
AINA
2008
IEEE
15 years 4 months ago
Exploiting Frequent Episodes in Weighted Suffix Tree to Improve Intrusion Detection System
In this paper we proposed a weighted suffix tree and find out it can improve the Intrusion Detection System (IDS). We firstly focus on the analysis of computer kernel system call,...
Min-Feng Wang, Yen-Ching Wu, Meng-Feng Tsai
111
Voted
ISMB
2000
14 years 11 months ago
Accelerating Protein Classification Using Suffix Trees
Position-specific scoring matrices have been used extensively to recognize highly conserved protein regions. We present a method for accelerating these searches using a suffix tre...
Bogdan Dorohonceanu, Craig G. Nevill-Manning
STACS
1992
Springer
15 years 1 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
BMCBI
2008
128views more  BMCBI 2008»
14 years 9 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
BIRTHDAY
2010
Springer
15 years 26 days ago
From Nondeterministic Suffix Automaton to Lazy Suffix Tree
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
Kimmo Fredriksson