Arne Andersson, N. Jesper Larsson, and Kurt Swanson, Suffix trees on words, Algorithmica Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Fast and Intuitive Clustering of Web Documents - Zamir (1997) (38 citations) (Correct)
....typically returned by the search engine in a different way. The suffix tree data structure has found many applications in string (e.g. in computational biology) and text processing, see for example [3] Space efficient algorithms for the construction of suffix trees on words are presented in [1]; however, due to the special requirements and characteristics of our domain, we do not use their algorithms. 13] mention the use suffix trees to find common substrings in computer virus programs in order to construct computer virus phylogenies. 8 Conclusion We have attempted to address the hard ....
Arne Anderson, N. Jesper Larsson, and Kurt Swanson. Suffix trees on words. In Combinatorial Pattern Matching, 1996.
Structures of String Matching and Data Compression - Larsson (1999) (10 citations) Self-citation (Larsson) (Correct)
No context found.
Arne Andersson, N. Jesper Larsson, and Kurt Swanson, Suffix trees on words, Algorithmica
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