9 search results - page 2 / 2 » Suffix Tree Based VF-Coding for Compressed Pattern Matching |
PR
2008
13 years 6 months ago
2008
Given the pervasive nature of malicious mobile code (viruses, worms, etc.), developing statistical/structural models of code execution is of considerable importance. We investigat...
BMCBI
2011
12 years 9 months ago
2011
Background: The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching dat...
IR
2008
13 years 6 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
SPIRE
2009
Springer
14 years 15 days ago
2009
Springer
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...