P. Weiner, Linear Pattern Matching Algorithms, Proc. of the 14-th Annual Symposium on Switching and Automata Theory, 1-11 (1973).  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... search for the longest run of a given motif (cf. 16] 17] 40] a unique sequence or the longest alignment (cf. 13] 40] These, and several other problems on words, can be efficiently solved and analyzed by a clever manipulation of a data structure known as a suffix tree (cf. 2] 27] [41]) In literature other names have been also coined for this structure, and among these we mention here position trees, subword trees, directed acyclic graphs, etc. cf. 1] Suffix trees find a wide variety of applications in algorithms on words including: the longest repeated substring (cf. ....

....[41] In literature other names have been also coined for this structure, and among these we mention here position trees, subword trees, directed acyclic graphs, etc. cf. 1] Suffix trees find a wide variety of applications in algorithms on words including: the longest repeated substring (cf. [41]) squares or repetitions in strings (cf. 3] string statistics (cf. 3] string matching (cf. 9] 42] approximate string matching (cf. 12] 9] 42] string comparison, compression schemes (cf. 25] implementation of the Lempel Ziv algorithm, genetic sequences, biologically significant ....

[Article contains additional citation context not shown here]

P. Weiner, Linear Pattern Matching Algorithms, Proc. of the 14-th Annual Symposium on Switching and Automata Theory, 1-11 (1973).

....in words [1, 2, 18] In this paper, we investigate the length of a subword that can be recopied in a random word X, that is, a subword that occurs at least twice in X. Periodicities, autocorrelations and related phenomena can be also studied on an associated digital tree called a suffix tree [1, 2, 3, 30]. A suffix tree is a digital tree that stores suffixes of a given word. In general, a digital tree that is also called a trie stores a set of words (strings, keys) W built over a finite alphabet Sigma, that is, W consists of possibly infinite strings of symbols from Sigma. A trie is ....

P. Weiner, Linear Pattern Matching Algorithms, Proc. of the 14-th Annual Symposium on Switching and Automata Theory, 1-11 (1973).

....of this, the asymptotic behavior of L n can be used to obtain the asymptotic bounds for the length l n in the Lempel Ziv parsing algorithm. EXAMPLE 1. 3 String Matching Algorithms Repeated substrings also arise in many algorithms on strings, notably string matching algorithms (cf. 1] 2] 33] [40]) A string matching algorithm searches for all (exact or approximate) occurrences of the pattern string P in the text string T . Consider either the Knuth Morris Pratt algorithm or the Boyer Moore algorithm (cf. 2] Both algorithms rely on an observation that in the case of a mismatch between T ....

....T and P , say at position n 1 of P , the next attempt to match depends on the internal structure (i.e. repeated substrings) of the first n symbols of the pattern P . It turns out that this problem can be efficiently solved by means of a suffix tree (cf. 1] 4] 5] 9] 14] 18] 28] [40]) In particular, recently Chang and Lawler [11] used suffix trees to design an algorithm that on average needs O( jT j=jP j) log jP j) steps to find all occurrences of the pattern P of length jP j in the text T of length jT j. 2 From the above discussion, one concludes that suffix trees can be ....

P. Weiner, Linear Pattern Matching Algorithms, Proc. of the 14-th Annual Symposium on Switching and Automata Theory, 111 (1973).

....1 Introduction In 1970, Knuth, Morris, and Pratt proposed their famous linear time pattern matching algorithm for two strings. Their algorithm was derived from a result of Cook that 2 way deterministic pushdown languages are recognizable on a RAM in linear time [Co71] In 1973, Weiner [PeWe73] presented a very original algorithm that performs linear time recognition of repeated instances of a substring in a string. Weiner s approach to this problem was as important as the solution to the problem itself. The relevance of his work was immediately appreciated. The result was announced in ....

P. Weiner, Linear Pattern Matching Algorithms. 14th Annual Symposium on Switching and Automata Theory. IEEE.

No context found.

P. Weiner, Linear Pattern Matching Algorithms, Proc. of the 14-th Annual Symposium on Switching and Automata Theory, 1--11 (1973).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC