Dong Kyue Kim, Jeong Seop Sim, Kunsoo Park  Home/Search
Context
Related
| theory.snu.ac.kr/./pa...dkkim_waac99.ps 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: theory.snu.ac.kr/research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Farach recently gave a linear-time algorithm for constructing suffix trees for integer alphabets, which solves a major open problem on index data structures. We present a new and somewhat cleaner algorithm for constructing suffix trees for integer alphabets in linear time. 1 (Update)
Similar documents (at the sentence level):
9.7%: Linear-Time Construction of Two-Dimensional Suffix Trees.. - Kim, al. (1999) (Correct)
Active bibliography (related documents): More All
0.6: Optimal Suffix Tree Construction with Large Alphabets - Farach (1997) (Correct)
0.5: Optimal Logarithmic Time Randomized Suffix Tree Construction - Farach, Muthukrishnan (1996) (Correct)
0.3: Dictionary Automaton in Optimal Space - Edelkamp (1999) (Correct)
Similar documents based on text: More All
0.6: Optimal Parallel Suffix Tree Construction - Hariharan (1997) (Correct)
0.2: An Optimal O(log log n) Time Parallel Algorithm for.. - Apostolico, Breslauer (1995) (Correct)
0.2: Parameterized Pattern Matching: Algorithms and Applications - Baker (1994) (Correct)
BibTeX entry: (Update)
@misc{ kim-suffix,
author = "Dong Kyue Kim and Jeong Seop Sim and Kunsoo Park",
title = "Suffix Trees for Integer Alphabets Revisited",
url = "citeseer.ist.psu.edu/470891.html" }
Citations (may not include all citations):172 A space-economical suffix tree construction algorithms (context) - McCreight - 1976
158 Linear pattern matching algorithms (context) - Weiner - 1973
136 Fast algorithms for finding nearest common ancestors (context) - Harel, Tarjan - 1984
95 On finding lowest common ancestors: simplification and paral.. (context) - Schieber, Vishkin - 1988
89 Efficient randomized pattern-matching algorithms (context) - Karp, Rabin - 1987
76 line construction of suffix trees - Ukkonen - 1995
22 Efficient and elegant subword tree construction (context) - Chen, Seiferas - 1985
20 Optimal suffix tree construction with large alphabets - Farach - 1997
14 Symmetry breaking for suffix tree construction (context) - Sahinalp, Vishkin - 1994
10 Optimal parallel suffix tree construction - Hariharan - 1994
9 Optimal logarithmic time randomized suffix tree construction - Farach, Muthukrishnan - 1996
9 Large-scale assembly of dna strings and space-efficient cons.. (context) - Kosaraju, Delcher - 1995
9 Large-scale assembly of dna strings and space-efficient cons.. (context) - Kosaraju, Delcher - 1996
8 Open problems in stringology (context) - Galil - 1985
Documents on the same site (http://theory.snu.ac.kr/research.html): More
The Consensus String Problem for a Metric is NP-Complete - Sim, Park (2001) (Correct)
Efficient Algorithms for Approximate String Matching with Swaps - Kim, Lee (1999) (Correct)
Approximate Periods of Strings - Sim, Iliopoulos, Park, Smyth (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