Self-normalised distance with don't cares
We present O(n log m) algorithms for a new class of problems termed self-normalised distance with don't cares. The input is a pattern p of length m and text t of length n > m. The elements of these strings are either integers or wild card symbols. In the shift version, the problem is to...
Main Authors: | Clifford, P, Clifford, R |
---|---|
Format: | Conference item |
Udgivet: |
2007
|
Lignende værker
-
Don’t Care but Feed
af: Lütfi Telci
Udgivet: (2016-12-01) -
The New Don’t Ask, Don’t Tell
af: Madeline Goldberg
Udgivet: (2014-03-01) -
‘If They Don’t Care, I Don’t Care’: Millennial and Generation Z Students and the Impact of Faculty Caring
af: Amy Chasteen Miller, et al.
Udgivet: (2019-08-01) -
Don't Cut There But There
af: Zeitlyn, D
Udgivet: (2003) -
Don't plan
af: 349464 Meyer, N. Dean