| Di Napoli Gianluca | 556/001924 |
| Fortino Vittorio | 556/002047 |
| Frola Bernardino | 556/002180 |
| Napoletano Domenico | 556/002075 |
| Vicidomini Luca | 556/001993 |
| Autori | Titolo | Fonte |
|---|---|---|
| T.H. Cormen, C.E. Leiserson, R.L. Rivest | “Introduzione agli Algoritmi” (prima edizione) |
Jackson Libri, capitolo 34, p825-831 (1999) |
| T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein | “Introduzione agli Algoritmi” (seconda edizione) |
Mc Graw Hill, capitolo 32, p777-779, p789-795 (2005) |
| P. Weiner | “Linear pattern matching algorithms” | Proc. Of the 14th IEEE Symp. On Switching and Automata Theory, p1-11 (1973) |
| E. Ukkonen | On-line construction of suffix-trees” | Algorithmica, volume 14, numero 3, p249-260 (1995) |
| P. Jokinen, J. Tarhio, E. Ukkonen | “A comparison of approximate string matching algorithms” | Software - Practice and Experience, volume 26, numero 12, p1439–1458 (1996) |
| E. Knuth, J. H. Morris, V. R. Pratt | “Fast Pattern Matching in Strings” | SIAM J. Computing, volume 6, numero 2, p323-350 (1977) |
| 17. E. M. McCreight | “A space-economical suffix tree contruction algorithm” | Communications of the ACM, volume 23, numero 2, p262-272 (1976) |
| R. S. Boyer, J. S. Moore | “A fast string searching algorithm” | Communications of the ACM, volume 20, numero 10, p762-772, (1977) |
| G. Navarro | “A Guided Tour to Aproximate String Matching” | Communications of the ACM, volume 33, numero 1, p31-88 (2001) |
| A.V. Aho, M.J. Corasick | “Efficient String Matching: An Aid to Bibliographic Search” | Communications of the ACM, volume 18, numero 6 (1975) |