3270 search results - page 3 / 654 » Approximate String Processing |
AIRS
2004
Springer
14 years 27 days ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
VLDB
2008
ACM
14 years 7 months ago
2008
ACM
INFORMATICALT
2006
13 years 7 months ago
2006
Abstract. Localization is a complex process based on translation and adaptation of software features. Usually localization progress is identified with the number of translated reso...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...