Roberto Grossi, Giuseppe F. Italiano  Home/Search
Context Related
| info.uniroma2.it/~italian...suffix.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dis.uniroma1.it...replist_by_year (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: : The suffix tree is a compacted trie that stores all suffixes of a given text string. This data structure has been intensively employed in pattern matching on strings and trees, with a wide range of applications, such as molecular biology, data processing, text editing, term rewriting, interpreter design, information retrieval, abstract data types and many others. In this paper, we survey some applications of suffix trees and some algorithmic techniques for their construction. Special emphasis ... (Update)
Context of citations to this paper: More
.... [178] The result has been extended to arbitrary trees in [179] These studies, together with other results, are summarized in [177] In [286] algorithmic techniques for the construction of suffix trees are surveyed, considering also generalizations of suffix trees in higher...
...of the string. The suffix tree has proven to be an extremely useful data structure in a wide variety of string processing algorithms [3, 6]. Kosaraju [10] defined the generalized suffix tree of all suffixes of a set of strings which are represented by a tree. Kosaraju mentions...
Cited by: More
The Suffix Tree of a Tree and Minimizing Sequential Transducers - Breslauer (1995) (Correct)
An overview of the Italian National Project on "Algorithms.. - Ausiello, d'Amore (Correct)
Active bibliography (related documents): More All
1.3: A Simple Parallel Dictionary Matching Algorithm - Ferragina (1997) (Correct)
0.8: A Data Structure for Circular String Analysis and Visualization - Mehta, Sahni (Correct)
0.7: Efficient Approximate and Dynamic Matching of.. - Süleyman Cenk.. (1996) (Correct)
Similar documents based on text: More All
1.4: Linear-Time Construction of Two-Dimensional Suffix Trees.. - Kim, al. (1999) (Correct)
0.8: Optimal Parallel Suffix Tree Construction - Hariharan (1997) (Correct)
0.8: Efficient Substring Traversal with Suffix Arrays - Kasai, Arimura, Arikawa (Correct)
Related documents from co-citation: More All
2: The set union problem with unlimited backtracking (context) - Apostolico, Gambosi et al.
2: alamo. Optimal algorithms for the maxima set problem for data in motion. Technic.. (context) - Franciosa, Gaibisso - 1992
2: volume 644 of Lecture Notes in Computer Science (context) - Apostolico, Crochemore et al. - 1992
BibTeX entry: (Update)
R. Grossi and G. F. Italiano. Suffix trees and their applications in string algorithms. In Proc. 1st South American Workshop on String Processing (WSP 1993), pages 57--76, September 1993. http://citeseer.ist.psu.edu/grossi93suffix.html More
@misc{ grossi93suffix,
author = "R. Grossi and G. Italiano",
title = "Suffix trees and their applications in string algorithms",
text = "R. Grossi and G. F. Italiano. Suffix trees and their applications in string
algorithms. In Proc. 1st South American Workshop on String Processing (WSP
1993), pages 57--76, September 1993.",
year = "1993",
url = "citeseer.ist.psu.edu/grossi93suffix.html" }
Citations (may not include all citations):1450 The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1974
458 A universal algorithm for sequential data compression - Ziv, Lempel - 1977
354 Digital Picture Processing (context) - Rosenfeld, Kak - 1982
347 Fast pattern matching in strings (context) - Knuth, Morris et al. - 1977
314 An Introduction to Parallel Algorithms (context) - J'aJ'a - 1992
227 Parallel merge sort (context) - Cole - 1988
214 A fast string searching algorithm (context) - Boyer, Moore - 1977
183 A data structure for dynamic trees (context) - Sleator, Tarjan - 1983
172 A space-economical suffix tree construction algorithm (context) - McCreight - 1976
158 Linear pattern matching algorithm (context) - Weiner - 1973
147 and Macromolecules: The Theory and Practice of Sequence Comp.. (context) - Sankoff, Kruskal - 1983
137 Efficient string matching: an aid to bibliographic search (context) - Aho, Corasick - 1975
136 Fast algorithms for finding nearest common ancestors (context) - Harel, Tarjan - 1984
121 Handbook of Algorithms and Data Structures (context) - Gonnet, Baeza-Yates - 1991
112 Suffix arrays: a new method for on-line string searches (context) - Manber, Myers - 1990
95 On finding lowest common ancestor: simplification and parall.. (context) - Schieber, Vishkin - 1988
82 Algorithms for finding patterns in strings (context) - Aho - 1990
78 PATRICIA -- Practical algorithm to retrieve information code.. (context) - Morrison - 1968
76 line construction of suffix trees - Ukkonen - 1993
75 Deterministic coin tossing with application to parallel list.. (context) - Cole, Vishkin - 1986
71 An improved algorithm for approximate string matching (context) - Galil, Park - 1990
60 Fast parallel and serial approximate string matching (context) - Landau, Vishkin - 1989
59 Speeding up two string-matching algorithms (context) - Crochemore, Czumaj et al. - 1994
56 The myriad virtues of subword trees (context) - Apostolico - 1985
55 The smallest automaton recognizing the subwords of a text (context) - Blumer, Blumer et al. - 1985
53 Rapid identification of repeated patterns in strings (context) - Karp, Miller et al. - 1972
51 A sublinear algorithm for approximate keyword searching (context) - Myers - 1994
50 Data compression with finite windows (context) - Fiala, Greene - 1989
49 the complexity of finite sequences (context) - Lempel, Ziv - 1976
47 New indices for text: PAT trees and PAT arrays (context) - Gonnet, Baeza-Yates et al. - 1992
46 difference algorithm and its variations (context) - Myers, An - 1986
43 Data structures and algorithms for approximate string matchi.. (context) - Galil, Giancarlo - 1988
43 Analysis and performance of inverted data base structures (context) - Cardenas - 1975
41 Some asymptotic properties of the entropy of a stationary er.. (context) - Wyner, Ziv - 1989
37 Improved deterministic parallel integer sorting (context) - Bhatt, Diks et al. - 1991
35 Fast string matching with k differences (context) - Landau, Vishkin - 1988
34 Theoretical Computer Science (context) - Crochemore - 1986
32 Linear algorithm for data compression via string matching (context) - Rodeh, Pratt et al. - 1991
31 expected asymptotic behaviors (context) - Szpankowski, suffix - 1993
28 Mathematical methods for DNA sequences (context) - Waterman - 1991
27 Parallel construction of a suffix tree with applications (context) - Apostolico, Iliopoulos et al. - 1988
26 Color set size problem with applications to string matching (context) - Hui - 1992
26 Asymptotic properties of data compression and suffix trees - Szpankowski - 1993
25 From Ukkonen to McCreight and Weiner: A unifying view of lin.. - Giegerich, Kurtz - 1994
25 Dynamic dictionary matching - Amir, Farach et al. - 1994
24 Sublinear approximate string matching and biological applica.. (context) - Chang, Lawler - 1994
24 A theory of parameterized pattern matching: algorithms and a.. - Baker - 1993
24 Faster tree pattern matching (context) - Dubiner, Galil et al. - 1994
23 A fully-dynamic data structure for external substring search (context) - Ferragina, Grossi - 1995
23 Optimal off-line detection of repetitions in a string (context) - Apostolico, Preparata - 1983
22 Efficient and elegant subword tree construction (context) - Chen, Seiferas - 1985
22 Approximate string-matching over suffix trees - Ukkonen - 1993
21 Analyzing and compressing assembly code (context) - Fraser, Wendt et al. - 1984
21 Self-alignment in words and their applications - Apostolico, Szpankowski - 1992
20 Complete inverted files for efficient text retrieval and ana.. (context) - Blumer, Blumer et al. - 1987
17 Average size of suffix trees and DAWGs (context) - Blumer, Ehrenfeucht et al. - 1989
15 A note on the height of suffix trees (context) - Devroye, Szpankowski et al. - 1993
13 Usefulness of the Karp-Miller-Rosenberg algorithm in paralle.. (context) - Crochemore, Rytter - 1991
12 An efficient algorithm for dynamic text indexing (context) - Gu, Farach - 1994
12 Introducing efficient parallelism into approximate string ma.. (context) - Landau, Vishkin - 1986
12 Entropy and prefixes (context) - Shields - 1992
10 Autocorrelation on words and its application: Analysis of su.. - Jacquet, Szpankowski - 1994
10 Estimating the information content of symbol sequences and e.. (context) - Grassberger - 1991
10 An efficient algorithm for all pairs suffix-prefix problem (context) - Gusfield, Landau et al. - 1992
10 Optimal parallel suffix tree construction - Hariharan - 1994
9 Suffix cactus: a cross between suffix tree and suffix array - Karkkainen - 1995
9 Efficient randomized dictionary matching algorithms - Amir, Farach et al. - 1992
9 Two-dimensional dictionary matching - Amir, Farach - 1992
8 Technical report OED (context) - Gonnet - 1988
8 the construction of classes of suffix trees for square matri.. (context) - Giancarlo, Grossi - 1995
8 Nucleic Acids Research (context) - Clift, Haussler et al. - 1986
8 Combinatorial Theory Ser (context) - Guibas, Odlyzko et al. - 1981
8 Combinatorial Theory Ser (context) - Guibas, Odlyzko et al. - 1981
7 Structural properties of the string statistics problem (context) - Apostolico, Preparata - 1985
6 Fast pattern matching in trees (context) - Kosaraju - 1989
6 A new distance metric on strings computable in linear time (context) - Ehrenfeucht, Haussler - 1988
5 Real-time pattern matching and quasi-real-time construction .. (context) - Kosaraju - 1994
5 Detection of periodicities and string-matching in real time (context) - Slisenko - 1983
5 Efficient on-line construction and correction of position tr.. (context) - Majster, Reiser - 1980
4 Lexicographically least circular substrings (context) - Booth - 1980
4 A linear time pattern matching algorithm between a string an.. (context) - Akutsu - 1993
4 The suffix tree of a square matrix (context) - Giancarlo - 1993
4 Polynomial-time algorithms for computing characteristic stri.. (context) - Ito, Shimizu et al. - 1994
3 Parallel construction and query of suffix trees for two-dime.. (context) - Giancarlo, Grossi - 1993
3 Fast canonization of circular strings (context) - Shiloach - 1981
3 Time optimal left to right construction of position trees (context) - Kempf, Bayer et al. - 1987
3 Private Communication (context) - Farach, Muthukrishnan - 1994
2 Principles of text processing (context) - Teskey - 1983
2 Parallel construction of minimal suffix and factor automata (context) - Crochemore, Rytter - 1990
2 Dictionary-matching on unbounded alphabets: uniform-length d.. - Breslauer - 1994
2 with applications to fast two-dimensional pattern matching (context) - Giancarlo - 1993
2 Improvements and applications for the Weiner repetition find.. (context) - Pratt - 1975
2 Suffix trees and string complexity (context) - Snider - 1992
2 A method for detecting structure in polygons (context) - Tanimoto - 1981
2 Incremental text editing: a new data structure (context) - Ferragina - 1994
1 A fast test for unique decipherability based on suffix trees (context) - Rodeh - 1982
1 Linear pattern matching of repeated substrings (context) - L'opez-Ortiz - 1994
1 Private communication (context) - Storer - 1995
1 A technique for designing computer access and selecting good.. (context) - Bagget, Ehrenfeucth et al. - 1986
1 Symmetry breaking for suffix tree construction Proc (context) - Sahinalp, Vishkin - 1994
1 Combinatorial Pattern Matching (context) - Kosaraju, Computation - 1994
1 Workshop report on visual information systems (context) - Jain - 1992
1 ACM-SIAM Symposium on Discrete Algorithms (context) - Ferragina, Grossi - 1995
Documents on the same site (http://www.dis.uniroma1.it/~alcom-it/AlcomArchive/replist_by_year.html): More
An Improved Linear Time Algorithm for Minimal Elimination.. - Dahlhaus (Correct)
A Hierarchical Adaptive Distributed Algorithm for.. - Antonis.. (Correct)
Dynamically Switching Vertices in Planar Graphs - Frigioni, Italiano (1999) (Correct)
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