Sciweavers

1028 search results - page 79 / 206
» Character sets of strings
Sort
View
FCT
2005
Springer
14 years 1 months ago
Fully Incremental LCS Computation
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, ...
STRINGOLOGY
2004
13 years 9 months ago
A Note on Bit-Parallel Alignment Computation
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
Heikki Hyyrö
COLING
1996
13 years 9 months ago
A Statistical Method for Extracting Uninterrupted and Interrupted Collocations from Very Large Corpora
In order to extractrigidexpressions with a high frequency of use, new algorithm that can efficientlyextract both uninterruptedand interruptedcollocationsfrom very large corpora ha...
Satoru Ikehara, Satoshi Shirai, Hajime Uchino
DATE
2008
IEEE
182views Hardware» more  DATE 2008»
14 years 2 months ago
An adaptable FPGA-based System for Regular Expression Matching
In many applications string pattern matching is one of the most intensive tasks in terms of computation time and memory accesses. Network Intrusion Detection Systems and DNA Seque...
Ivano Bonesana, Marco Paolieri, Marco D. Santambro...
ALGORITHMICA
2010
164views more  ALGORITHMICA 2010»
13 years 7 months ago
Space Efficient Algorithms for the Burrows-Wheeler Backtransformation
The Burrows-Wheeler transformation is used for effective data compression, e.g., in the well known program bzip2. Compression and decompression are done in a block-wise fashion; la...
Ulrich Lauther, Tamás Lukovszki