The tag has no wiki summary.

learn more… | top users | synonyms

0
votes
0answers
38 views

Complexities of basic operations of searching and sorting algorithms

Wiki has a good cheat sheet, but however it does not involve no. of comparisons or swaps. (though no. of swaps is usually decides its complexity). So I created the following. Is the following info is ...
2
votes
0answers
52 views

What limits the implementation of proximity operators for text indexing and searching?

I was asking on academia.se, if anyone knows scientific search engines offering a proximity operator like Google Web Search does, while Google Scholar Search does not. That's sad, because this ...
0
votes
0answers
15 views

Search entire website [closed]

I would like to monitor a website such that if anything changes in the website, I should get information about the changes. This could be any website, and can have any number of pages. Can you please ...
3
votes
1answer
106 views

Randomized String Searching

I need to detect whether a binary pattern $P$ of length $m$ occurs in a binary text $T$ of length $n$ where $m < n$. I want to state an algorithm that runs in time $O(n)$ where we assume that ...
6
votes
1answer
605 views

Connection between KMP prefix function and string matching automaton

Let $A_P = (Q,\Sigma,\delta,0,\{m\})$ the string matching automaton for pattern $P \in \Sigma^m$, that is $Q = \{0,1,\dots,m\}$ $\delta(q,a) = \sigma_P(P_{0,q}\cdot a)$ for all $q\in Q$ and $a\in ...