147 search results - page 9 / 30 » Algorithms for Computing the Longest Parameterized Common Su... |
IFIP
2004
Springer
15 years 2 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
79
Voted
EMNLP
2009
14 years 7 months ago
2009
We present a method for detecting and correcting multiple real-word spelling errors using the Google Web 1T 3-gram data set and a normalized and modified version of the Longest Co...
82
Voted
STRINGOLOGY
2004
14 years 11 months ago
2004
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...
100
click to vote
DIS
2000
Springer
15 years 1 months ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...