Re: the lowest number of comparisons in string matching
- From: Tor Myklebust <tmyklebu@xxxxxxxxxxxxxxxxxxx>
- Date: Tue, 26 Sep 2006 04:55:19 +0000 (UTC)
laura <laura.brandusan@xxxxxxxxx> wrote:
Hi,
Which is the number of comparisons in the worst case?
I'm not actually certain what the exact bound is, but I do believe that
one needs at least n character comparisons in the worst case to check
whether a pattern occurs in a text. (This includes any preprocessing
done on the pattern.)
Tor Myklebust
.
- References:
- the lowest number of comparisons in string matching
- From: laura
- Re: the lowest number of comparisons in string matching
- From: Tim Peters
- Re: the lowest number of comparisons in string matching
- From: Tor Myklebust
- Re: the lowest number of comparisons in string matching
- From: laura
- the lowest number of comparisons in string matching
- Prev by Date: Re: On the complexity of determining whether n numbers are distinct
- Next by Date: Re: On the complexity of determining whether n numbers are distinct
- Previous by thread: Re: the lowest number of comparisons in string matching
- Next by thread: (Probably flawed) Polynomial time Graph Isomorphism
- Index(es):