Robert Giegerich, Stefan Kurtz  Home/Search
Context Related
| unibielefeld.de/p...InSCP25No23.ps.gz 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: techfak.unibielef...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We explore the design space of implementing suffix tree algorithms in the functional paradigm. We review the linear time and space algorithms of McCreight and Ukkonen. Based on a new terminology of nested suffixes and nested prefixes, we give a simpler and more declarative explanation of these algorithms than was previously known. We design two "naive" versions of these algorithms which are not linear time, but use simpler data structures, and can be implemented in a purely functional style.... (Update)
Context of citations to this paper: More
.... We developed a pattern discovery algorithm based on the suffix tree data structure [21, 35] The lazy suffix tree generation algorithm [12] was extended for generating the suffixes of all sequences in the set, and further, to generate only the patterns that match the...
...1995) We construct a suffix trie for our set of sequences G. Our construction procedure is inspired by the lazy algorithm of (Giegerich and Kurtz 1995) for generating suffix trees. The resulting trie represents all the patterns (in the chosen class of patterns) that are...
Cited by: More
Random Suffix Search Trees - Devroye, Neininger (2003) (Correct)
Identification Of Common Molecular Subsequences - Smith, Waterman (1981) (Correct)
Universal Data Compression Based on the Burrows and.. - Balkenhol, Kurtz (1998) (Correct)
Active bibliography (related documents): More All
0.8: From Ukkonen to McCreight and Weiner: A Unifying View of.. - Giegerich, Kurtz (1997) (Correct)
0.7: Suffix Trees and their Applications in String Algorithms - Grossi, Italiano (1993) (Correct)
0.5: On-Line Construction of Suffix Trees - Ukkonen (1995) (Correct)
Similar documents based on text: More All
0.1: Static and Dynamic Filtering Methods for.. - Giegerich.. (1996) (Correct)
0.1: A General Technique to Improve Filter Algorithms.. - Giegerich.. (1997) (Correct)
0.1: Approximate String Searching under Weighted Edit Distance - Kurtz (1996) (Correct)
Related documents from co-citation: More All
6: A space-economical suffix tree construction algorithm (context) - McCreight - 1976
5: line construction of suffix trees - Ukkonen - 1995
5: Linear pattern matching algorithms (context) - Weiner - 1973
BibTeX entry: (Update)
R. Giegerich and S. Kurtz. A Comparison of Imperative and Purely Functional Suffix Tree Constructions. Science of Computer Programming, 25(2-3):187--218, 1995. http://citeseer.ist.psu.edu/giegerich95comparison.html More
@article{ giegerich95comparison,
author = "Robert Giegerich and Stefan Kurtz",
title = "A Comparison of Imperative and Purely Functional Suffix Tree Constructions",
journal = "Science of Computer Programming",
volume = "25",
number = "2-3",
pages = "187-218",
year = "1995",
url = "citeseer.ist.psu.edu/giegerich95comparison.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
293 The Essence of Functional Programming - Wadler - 1992
172 A Space-Economical Suffix Tree Construction Algorithm (context) - McCreight - 1976
158 Linear Pattern Matching Algorithms (context) - Weiner - 1973
112 Suffix Arrays: A New Method for On-Line String Searches (context) - Manber, Myers - 1993
112 Suffix Arrays: A New Method for On-Line String Searches (context) - Manber, Myers - 1990
95 Elements of Functional Programming (context) - Reade - 1989
76 line Construction of Suffix-Trees - Ukkonen - 1993
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
52 Approximate String-Matching with q-Grams and Maximal Matches (context) - Ukkonen - 1992
33 Implementing Haskell Overloading - Augustsson - 1993
32 Approximate String Matching in Sublinear Expected Time (context) - Chang, Lawler - 1990
29 Memory Subsystem Performance of Programs Using Copying Garba.. - Diwan, Tarditi et al. - 1994
29 Constructing Suffix Trees On-line in Linear Time (context) - Ukkonen - 1992
25 From Ukkonen to McCreight and Weiner: A Unifying View of Lin.. - Giegerich, Kurtz - 1994
22 Efficient and Elegant Subword Tree Construction (context) - Chen, Seiferas - 1985
21 Self-Alignments in Words and Their Applications - Apostolico, Szpankowski - 1992
17 Haskell Special Issue (context) - Fasel, Hudak et al. - 1992
10 Fundamental Algorithms for a Declarative Pattern Matching Sy.. (context) - Kurtz - 1995
9 Mutable Abstract Data Types or How to Have Your State and Mu.. (context) - Hudak - 1993
7 Are Applicative Languages Inefficient (context) - Ponder, McGeer et al. - 1988
6 Parallel Construction of a Suffix Tree (context) - Apostolico, Iliopoulos et al. - 1988
6 String Matching with Constraints (context) - Crochemore - 1988
5 Efficient On-line Construction and Correction of Position Tr.. (context) - Majster, Reiser - 1980
3 Suffix Trees in the Functional Programming Paradigm (context) - Giegerich, Kurtz - 1994
3 Time Optimal Left To Right Construction of Position Trees (context) - Kempf, Bayer et al. - 1987
3 Benchmarking Implementations of Functional Languages - Hartel, Langendoen - 1993
2 Embedding Sequence Analysis in the Functional Programming Pa.. - Giegerich - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.techfak.uni-bielefeld.de/techfak/ags/pi/Agpi/publications.html): More
On the Modularity of Termination of Term Rewriting Systems - Ohlebusch (1993) (Correct)
Narrowing and Basic Forward Closures - Kurtz (1992) (Correct)
Modular Properties of Constructor-Sharing Conditional Term.. - Ohlebusch (1995) (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