Searching for "Transposition invariant string matching." – sorted by Relevance.
7 documents found, showing 1 through 7.
-
Algorithms for Transposition Invariant String Matching (Extended Abstract)
- …Algorithms for Transposition Invariant String Matching (Extended Abstract) Veli Mkinen 1…
- Cited by 5 (5 self) – Add To MetaCart
-
Practical Algorithms for Transposition-Invariant String-Matching
- …Practical Algorithms for Transposition-Invariant String-Matching # Kjell Lemstrom a,1 Gonzalo…
- Cited by 8 (3 self) – Add To MetaCart
-
O(mn log σ) Time Transposition Invariant LCS Computation
- … invariant string matching is the problem of matching two strings when all the characters of either of them…
- Add To MetaCart
-
Matching Numeric Strings under Noise
- … for matching numeric strings with and without transposition invariance under noise; we consider distance…
- Add To MetaCart
-
Rotation and lighting invariant template matching
- …], for one-dimensional transposition invariant string matching, obtains O(σ + |P |) time on integer alphabet…
- Cited by 2 (1 self) – Add To MetaCart
-
Efficient computation of gapped substring kernels on large alphabets
- …, to speed up transposition invariant string matching (Mäkinen, 2003) and, more close to our problem…
- Cited by 8 (0 self) – Add To MetaCart
-
Efficient Computation of Gap-Weighted String Kernels On Large Alphabets
- … used, for example, to speed up transposition invariant string matching (Makinen, 2003) and, more close…
- Cited by 1 (0 self) – Add To MetaCart
Showing 1 through 7.
