#### DMCA

## Suffix Cactus: A Cross between Suffix Tree and Suffix Array (1995)

### Cached

### Download Links

- [www.cs.helsinki.fi]
- [www.cs.helsinki.fi]
- DBLP

### Other Repositories/Bibliography

Citations: | 35 - 2 self |

### Citations

824 | Suffix arrays: A new method for on-line string searches
- Manber, Myers
- 1993
(Show Context)
Citation Context ...construction time are linear in the length of the text [19, 14, 17]. Suffix trees have a wide variety of applications. Apostolico [4] cites over forty references on suffix trees, and Manber and Myers =-=[13]-=- mention several newer ones. The application, that we are mostly interested in in this paper, is the use of a suffix tree as an index of a large static text to allow fast searches. The basic search ty... |

799 |
Fast pattern matching in strings
- Knuth, Morris, et al.
- 1977
(Show Context)
Citation Context ...he pattern. The problem of string matching is to find the occurrences of string P as a subtring of T . It can be solved in linear time by scanning text T using, e.g., the KnuthMorris -Pratt algorithm =-=[12]-=-. For a large static text, a faster solution can be achieved by preprocessing the text. Suffix trees, suffix arrays and suffix cactuses are suitable preprocessing structures. In regular expression mat... |

632 | A space-economical suffix tree construction algorithm - McCreight - 1976 |

271 |
Sorting and Searching, volume 3 of The Art of Computer Programming
- Knuth
- 1973
(Show Context)
Citation Context ...o strings and let j be the largest number for which S j = T j . Then the string S j = T j is called the longest common prefix of S and T and its length j is denoted lcp(S; T ). A trie (see e.g. Knuth =-=[11]-=-) is a rooted tree with the following properties. 1. Each node, except the root, contains a symbol of the alphabet. 2. No two children of the same node contain the same symbol. A node v represents the... |

128 |
The myriad virtues of subword trees
- Apostolico
- 1985
(Show Context)
Citation Context ...tring. What makes the suffix tree attractive is that its size and its construction time are linear in the length of the text [19, 14, 17]. Suffix trees have a wide variety of applications. Apostolico =-=[4]-=- cites over forty references on suffix trees, and Manber and Myers [13] mention several newer ones. The application, that we are mostly interested in in this paper, is the use of a suffix tree as an i... |

103 |
A Sublinear Algorithm for Approximate Keyword Searching
- Myers
- 1994
(Show Context)
Citation Context ...replaced by another suffix structure. The above method for approximate string matching is more efficient than the basic text scan method only with short patterns and small values of k. However, Myers =-=[15]-=- has developed a method to do efficient approximate string matching even with long patterns and large k. The method divides the pattern into smaller parts whose approximate occurrences with small edit... |

96 |
pattern matching algorithms
- Linear
- 1973
(Show Context)
Citation Context ...ure formed from a string that allows many kinds of fast queries about the string. What makes the suffix tree attractive is that its size and its construction time are linear in the length of the text =-=[19, 14, 17]-=-. Suffix trees have a wide variety of applications. Apostolico [4] cites over forty references on suffix trees, and Manber and Myers [13] mention several newer ones. The application, that we are mostl... |

84 |
An improved algorithm for approximate string matching
- Galil, Park
- 1990
(Show Context)
Citation Context ...f these problems can be solved by scanning the text. Regular expression matching takes O(n) time (excluding the preprocessing of the regular expression) [1] and approximate string matching O(kn) time =-=[7, 18]-=-. Baeza-Yates and Gonnet have described methods to use the suffix tree to do both regular expression matching [5] and approximate string matching [6]. The latter idea was also independently mentioned ... |

76 | Two algorithms for approximate string matching in static texts - Jokinen, Ukkonen - 1991 |

59 |
Constructing suffix trees on-line in linear time
- Ukkonen
- 1992
(Show Context)
Citation Context ...ure formed from a string that allows many kinds of fast queries about the string. What makes the suffix tree attractive is that its size and its construction time are linear in the length of the text =-=[19, 14, 17]-=-. Suffix trees have a wide variety of applications. Apostolico [4] cites over forty references on suffix trees, and Manber and Myers [13] mention several newer ones. The application, that we are mostl... |

37 | Efficient implementation of suffix trees
- Andersson, Nilsson
- 1995
(Show Context)
Citation Context ... suffix tree or as a suffix array augmented with some extra information. The suffix cactus can therefore be called a cross between the suffix tree and the suffix array. Recently, Anderson and Nilsson =-=[2, 3]-=-, and Irving [9] have introduced new alternative data structures. The level compressed trie of Andersson and Nilsson takes about 12 bytes per text symbol and has matching properties comparable to the ... |

34 | Improved behaviour of tries by adaptive branching
- Andersson, Nilsson
- 1993
(Show Context)
Citation Context ... suffix tree or as a suffix array augmented with some extra information. The suffix cactus can therefore be called a cross between the suffix tree and the suffix array. Recently, Anderson and Nilsson =-=[2, 3]-=-, and Irving [9] have introduced new alternative data structures. The level compressed trie of Andersson and Nilsson takes about 12 bytes per text symbol and has matching properties comparable to the ... |

24 | Lexicographical indices for text: Inverted files vs. pat trees
- Gonnet, Baeza-Yates, et al.
- 1991
(Show Context)
Citation Context ...tring in the text. Other useful forms of queries include regular expression matching and approximate string matching. Examples of very large texts requiring fast searching are electronic dictionaries =-=[8]-=-, and biological sequence databases [16]. To work efficiently, the whole suffix tree must fit in the main memory. Thus the space requirement of the suffix tree is an important issue. Gonnet, BaezaYate... |

22 |
D.: Approximate string matching with suffix automata
- Ukkonen, Wood
- 1993
(Show Context)
Citation Context ...f these problems can be solved by scanning the text. Regular expression matching takes O(n) time (excluding the preprocessing of the regular expression) [1] and approximate string matching O(kn) time =-=[7, 18]-=-. Baeza-Yates and Gonnet have described methods to use the suffix tree to do both regular expression matching [5] and approximate string matching [6]. The latter idea was also independently mentioned ... |

21 |
Ecient text searching of regular expressions
- Baeza-Yates, Gonnet
- 1989
(Show Context)
Citation Context ...ocessing of the regular expression) [1] and approximate string matching O(kn) time [7, 18]. Baeza-Yates and Gonnet have described methods to use the suffix tree to do both regular expression matching =-=[5]-=- and approximate string matching [6]. The latter idea was also independently mentioned in [10, Remark 2]. Both of these methods are based on scanning one suffix of T at a time to find whether it has a... |

14 |
SuÆx binary search trees
- Irving
- 1995
(Show Context)
Citation Context ...a suffix array augmented with some extra information. The suffix cactus can therefore be called a cross between the suffix tree and the suffix array. Recently, Anderson and Nilsson [2, 3], and Irving =-=[9]-=- have introduced new alternative data structures. The level compressed trie of Andersson and Nilsson takes about 12 bytes per text symbol and has matching properties comparable to the suffix cactus. T... |

12 | All-against-all sequence matching
- Baeza-Yates, Gonnet
- 1990
(Show Context)
Citation Context ...[1] and approximate string matching O(kn) time [7, 18]. Baeza-Yates and Gonnet have described methods to use the suffix tree to do both regular expression matching [5] and approximate string matching =-=[6]-=-. The latter idea was also independently mentioned in [10, Remark 2]. Both of these methods are based on scanning one suffix of T at a time to find whether it has a matching prefix. The methods take a... |

10 |
The Design and Analysis of Computer Algorithms, chapter 10.6
- Aho, Hopcroft, et al.
(Show Context)
Citation Context ...distance between P and T i is at most k. Both of these problems can be solved by scanning the text. Regular expression matching takes O(n) time (excluding the preprocessing of the regular expression) =-=[1]-=- and approximate string matching O(kn) time [7, 18]. Baeza-Yates and Gonnet have described methods to use the suffix tree to do both regular expression matching [5] and approximate string matching [6]... |