421 search results - page 1 / 85 » String Distances and Uniformities |
ICANNGA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The Levenstein or edit distance was developed as a metric for calculating distances between character strings. We are looking at weighting the different edit operations (...
IPL
2008
13 years 4 months ago
2008
Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well
MFCS
2005
Springer
13 years 10 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...
SPIRE
2009
Springer
13 years 11 months ago
2009
Springer
The consensus string problem is finding a representative string (consensus) of a given set S of strings. In this paper we deal with the consensus string problems optimizing both d...
TCS
2002
13 years 4 months ago
2002
The concept of pseudorandomness plays an important role in cryptography. In this note, we contrast the notions of complexity-theoretic pseudorandom strings (from algorithmic infor...