Aho, A.V., "Algorithms for finding patterns in strings," pp. 255-300 in Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, ed. J. van Leeuwen,The M.I.T. Press, Cambridge, MA (1990).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....accurate to describe A as one large automaton with several sub automata. As in [3] we build a hot path automaton for recognizing a set of hot paths by building a trie A of the paths and defining a failure function that maps a vertex of the trie and a supergraph edge to another vertex of the trie [2]. We then consider A to be a DFA whose transition function is given by the edges of the trie and the failure function. For each procedure P , we create a trie of the hot paths that start in P . Hot paths that can only be reached by following a backedge u v are prefixed with the special symbol ....

Alfred V. Aho. Algorithms for finding patterns in strings, chapter 5, pages 255--300. MIT Press, 1994.

.... We have only found two reconstructions of Boyer and Moore s string matcher in the literature: Partsch and Stomp s formal derivation [45] and just recently Hernandez and Rosenblueth s logic program derivation [31] But as reviewed in Aho s chapter in the Handbook of Theoretical Computer Science [1], several variants of Boyer and Moore s string matcher exist (such as Sunday s variant [52] and Baeza Yates, Cho#rut, and Gonnet s variant [6] with recurrent concerns about linearity in principle (e.g. Schaback s work [47] and in practice (e.g. Horspool s work [33] 7 Conclusion and issues ....

Alfred V. Aho. Algorithms for finding patterns in strings. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 5, pages 255--300. The MIT Press, 1990.

....(and wrt. fixed p) one achieves target programs implementing the KMP algorithm BM algorithms. Finally, section 7.6 compares with related work. Some remarks concerning our treatment: It is easy to see how it can be coded as level 0 rules. For a survey of pattern matching algorithms, see [Aho90] 160 . we will not formally prove that the target programs indeed implement the KMP BM algorithms, as this would require a rather heavy machinery; no attention will be paid to the complexity of the preprocessing phase; as it is a rather common exercise to achieve the KMP algorithm by ....

Alfred V. Aho. Algorithms for finding patterns in strings. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. A, chapter 5. Elsevier, 1990.

....= zero c = 1 2 a three a a four a Figure 2: Example XML document MSL uses a mathematical notation that is more compact than XML, and more amenable to formal use. Mathematical notation is used for model groups, components, and documents. MSL uses standard regular expression notation [2] for model groups. In what follows, g stands for a model group (as does g1 , g2 , and so on) The constructors for model groups include the following. # empty sequence long form short form http: www.foo.org baz.xsd#element: a a http: www.foo.org baz.xsd#type: s s ....

....not nest declarations to express their scope. Instead, the scope of a declaration is reflected in its normalized name. MSL also provides a compact notation for XML documents, both before and after normalization. Here is the original document in MSL notation. a[ xsi:type[ u ] b[ zero ] c[1,2], d[ a[ three ] a[ four ] Note that attributes and elements are represented uniformly, as are sequences of attributes, sequences of elements, and lists of atomic datatypes. Here is the normalized document in MSL notation. a[ xsi:type[ u ] t b[ zero ] t c[1,2] u d[ ....

[Article contains additional citation context not shown here]

Alfred V. Aho. Algorithms for finding patterns in strings. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science. MIT Press Elsevier, Cambridge, Massachusetts, 1990.

....VA can be used. If an error model is provided, the same Viterbi framework can be adopted for ECP, but at the expense of a higher computational cost. Unfor Note that this work is also related to the problem of (approximately) matching regular expressions, since they are equivalent to FSMs. See [2] for an introduction to this problem. tunately, this higher cost can become prohibitive in many applications of interest. The computational problem of ECP is outlined in the next section. Solutions to this problem are proposed in Sects. 3, 4 and 5. Sect. 6 describes the adaptation of the ....

A.V. Aho, "Algorithms for Finding Patterns in Strings", In Algorithms and Complexity, Volume A, pp. 255--300, edited by J. V. Leeuwen. Handbook of Theoretical Computer Science. Elsevier Science Publishers, (MIT Press co-publisher for USA, Canada and Japan), 1990. 18

....which are currently used to explore the vast data bases generated by genetic sequencing. 1 Introduction Finite automaton are powerful devices for computing on sequences of characters. Among the finest examples, very elegant linear algorithms have been developed for the string matching problem [1]. Automata are also widely used in fields such as metric lexical analysis [3] or bio computing, where approximate string matching is at the core of most algorithms that deal with genetic sequences [4] In these fields, the huge amount of data to be processed sometimes billions of characters ....

A. Aho, Algorithms for Finding Patterns in Strings, in Handbook of Theoretical Computer Science, Vol. A, Elsevier (1990) 255-300.

....of the automata. Keywords: Vector algorithms, computational biology, string matching. 1. Introduction Finite automata are powerful devices for computing on sequences of characters. Among the finest examples, very elegant linear algorithms have been developed for the string matching problem [1]. Automata are also widely used in fields such as metric lexical analysis [3] or computational biology, where approximate string matching is at the core of most algorithms that deal with genetic sequences [11] 4] In these fields, the huge amount of data to be processed sometimes billions of ....

A. Aho, Algorithms for Finding Patterns in Strings, in Handbook of Theoretical Computer Science, Vol. A, Elsevier, (1990), 255-300.

....cost 1: this does not allow for generality (some schemes can be easier ) but does entail that our results are independent of the score scheme in the sense that we will not allow the score scheme to be modified unnaturally to obtain negative results. This distance has been thoroughly studied (see [2] for instance) and is used in many cases because, in contrast with other natural distances between strings it is polynomially computable: Wagner Fisher [15] give a dynamic programming algorithm that computes this distance in O( u . v ) time, where u and v are the two strings involved. A ....

A.V. Aho, Algorithms for Finding Patterns in Strings, in: Handbook of Theoretical Computer Science"(Elsevier, Amsterdam, 1990) 290-300.

.... For example, it is the first axiomatic principle in theoretical immunology [Per79] and is widely considered as the key activity which will enable emerging computer aided drug design [Per90] A comprehensive survey on string and several pattern matching techniques in computer science is given in [Aho90]. The major impetus to widespread use of pattern matching was due to a code generation scheme suggested by Hoffman and McDonnel [Hof82] The tree matching method has been used in a number of successful compiler projects [Aho90] Through use of the tree processing language Twig [Aho89] it was also ....

.... several pattern matching techniques in computer science is given in [Aho90] The major impetus to widespread use of pattern matching was due to a code generation scheme suggested by Hoffman and McDonnel [Hof82] The tree matching method has been used in a number of successful compiler projects [Aho90]. Through use of the tree processing language Twig [Aho89] it was also applied in logic synthesis for technology mapping [Keu87] Template matching has attracted a great deal of interest in behavioral synthesis [Not91] Other pattern matching approaches in logic synthesis were predating the ....

A.V. Aho, "Algorithms for Finding Patterns in Strings." Handbook of Theoretical Computer Science, Vol. A, ed. Jan van Leeuwen, Chap. 5, 255-300, 1990.

....high confidence Great many string matching algorithms can be found in the literature. Exact string matching algorithms [8] are not applicable in this case. They are designed to indicate if text occurrences are found within a text and are optimized to be very fast. More elaborate string matching [7,9] algorithms allow a level of mismatch, such as k mismatch matching algorithms, and string matching with k differences. The first allows matches where up to k characters in the pattern do not match the text, and the second requires that the pattern have an edit distance from the text of k or less. ....

Alfred V. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 5, pages 254-300. Elsevier Science Publishers B. V., 1990.

....processing, as well as in the KDD field itself. For example, Agrawal et al. 3] provide a shape definition language, SDL, for expressing shapes in sequences. In the context of categorical data, the problem has been addressed by Mannila et al. 4] and by the string matching research community [5]. Mannila et al. [4] define temporal patterns in sequences of events with episodes, where episodes are defined as partially ordered sets of events that can be described by directed acyclic graphs. Given a class of such episodes they describe an efficient algorithm that finds all frequent episodes ....

....at the same time. In addition, their approach works on sequences, and not on temporal databases (i.e. temporal predicates changing over time) String matching researchers use regular expressions to define patterns on strings of alphabets and develop efficient string matching algorithms. Aho [5] presents a survey of such algorithms. Regular expressions are defined over an alphabet, and therefore this approach works well with strings of symbols but does not generalize to temporal databases, where predicates change over time. In this paper we extend the work of Mannila et al. 4] finding ....

Aho, A.V., 1990. Algorithms for Finding Patterns in Strings. In van Leeuwen, J., ed., Handbook of Theoretical Comp. Sc., Vol A :Algorithms and Complexity. Elsevier.

....using the name for such types leads to no confusion. MSL uses a mathematical notation that is more compact than XML, and more amenable to formal use. Mathematical notation is used for model groups, components, and documents. 4 2.1. 1 Model groups MSL uses standard regular expression notation [2] for model groups. In what follows, g stands for a model group (as does g 1 , g 2 , and so on) The constructors for model groups include the following. # empty sequence # empty choice g 1 , g 2 sequence, g 1 followed by g 2 g 1 g 2 choice, g 1 or g 2 g 1 g 2 all, g 1 and g 2 in either ....

....to express their scope. Instead, the scope of a declaration is reflected in its normalized name. 2.1.3 Documents MSL also provides a compact notation for XML documents, both before and after normalization. Here is the original document in MSL notation. a[ xsi:type[ u ] b[ zero ] c[1,2], d[ a[ three ] a[ four ] Note that attributes and elements are represented uniformly, as are sequences of attributes, sequences of elements, and lists of atomic datatypes. Here is the normalized document in MSL notation. a[ xsi:type[ u ] t b[ zero ] t c[1,2] u d[ u d a[ three ] ....

[Article contains additional citation context not shown here]

Alfred V. Aho. Algorithms for finding patterns in strings. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science. MIT Press Elsevier, Cambridge, Massachusetts, 1990.

....fcgg and fa; b ) fcgg are considered equal, and t 1 [ t 2 should be read as set union. We will explain this in the sequel. 2. 3 Epsilon Edges As said earlier, we allow edges to be labeled with a special symbol, The meaning of such an edge is related to that of an empty transition in automata [Aho90, pp.282] and is just a notational convenience for describing succinctly more complex graphs. Whenever two vertices v; v 0 are connected by an edge, the intended meaning is that all edges emerging from v 0 should also emerge from v. This is illustrated in Figure 4. Figure 5 illustrates why ....

Alfred V. Aho. Algorithms for finding patterns in strings. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science. Vol A: Algorithms and Complexity. MIT Press, 1990.

....data processing, text editing, term rewriting, interpreter design, information retrieval, abstract data types and many others. 5 One classical example is string matching , which consists of finding all the occurrences of a pattern y as substring of a text x [20, 69] see also the survey of Aho [1]) Crochemore et al. 29] have used the suffix tree built on the pattern y to speed up linear time algorithms for string matching both in practice and on the average. The suffix tree defined on a dynamic set of strings, instead of a single string, has been used by Amir et al. 6] to obtain a ....

Aho, A. V., Algorithms for finding patterns in strings, in Handbook of Theoretical Computer Science, vol. A, J. van Leeuwen ed., MIT Press, Cambridge, MA, 255-- 300, (1990).

No context found.

Aho, A.V., "Algorithms for finding patterns in strings," pp. 255-300 in Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, ed. J. van Leeuwen,The M.I.T. Press, Cambridge, MA (1990).

No context found.

Aho, A.V., "Algorithms for finding patterns in strings," pp. 255-300 in Handbook of Theor. Comp. Sci., Vol. A: Algorithms and Complexity, ed. J. van Leeuwen,The M.I.T. Press, Cambridge, MA (1990).

No context found.

A. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science (Volume A): Algorithms and Complexity, pages 257--295. Elsevier, 1990.

No context found.

A. V. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity, chapter 5, pages 257--

No context found.

A. Aho. Algorithms for Finding Patterns in Strings. Handbook of TCS., J. Van Leeuwen editor, volume A, chapter 5, Elsevier, 1990.

No context found.

A. Aho. Algorithms for Finding Patterns in Strings. Handbook of TCS., J. Van Leeuwen editor, volume A, chapter 5, Elsevier, 1990.

No context found.

A. Aho. Algorithms for Finding Patterns in Strings. Handbook of TCS., J. Van Leeuwen editor, volume A, chapter 5, Elsevier, 1990.

No context found.

A.V. Aho, Algorithms for finding patterns in strings. In: Handbook of Theoretical Computer Science Vol. A, (J. van Leeuwen, Ed.), Elsevier 1990, pp. 255--300. 11

No context found.

A. V. Aho, Algorithms for finding patterns in strings, In: (J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol A, Algorithms and complexity, Elsevier, Amsterdam, 1990) 255--300.

No context found.

A.V. Aho. Algorithms for finding patterns in strings. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity. Elsevier, 1990.

No context found.

AHO, A. V. Algorithms for finding patterns in strings. In Handbook of Theoretical Computer Science (1990), J. van Leeuwen, Ed., vol. A, North-Holland, pp. 255--300.

First 50 documents  Next 50

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