Sciweavers

170 search results - page 13 / 34
» Algorithms on Compressed Strings and Arrays
Sort
View
CPM
1999
Springer
141views Combinatorics» more  CPM 1999»
15 years 2 months ago
Approximate Periods of Strings
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di...
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park,...
IPPS
2010
IEEE
14 years 7 months ago
Scalable multi-pipeline architecture for high performance multi-pattern string matching
Multi-pattern string matching remains a major performance bottleneck in network intrusion detection and anti-virus systems for high-speed deep packet inspection (DPI). Although Aho...
Weirong Jiang, Yi-Hua Edward Yang, Viktor K. Prasa...
FOCS
2009
IEEE
15 years 1 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
15 years 11 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu
JDA
2008
87views more  JDA 2008»
14 years 9 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...