SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Algorithmica (New York)

Volumn 23, Issue 3, 1999, Pages 246-260

Suffix trees on words

(3) Andersson, A a Larsson, N J a Swanson, K a

a LUND UNIVERSITY (Sweden)

Author keywords

Substring searching; Suffix trees

Indexed keywords

EID: 0013011471 PISSN: 01784617 EISSN: None Source Type: Journal
DOI: 10.1007/PL00009260 Document Type: Article

Times cited : (31)

References (18)

1
- 0030383550
- Faster deterministic sorting and searching in linear space
- th IEEE Symposium on Foundations of Computer Science (FOCS '96), pages 135-141, 1996.
- (1996) th IEEE Symposium on Foundations of Computer Science (FOCS '96) , pp. 135-141
- Andersson, A.¹

2
- 0001216899
- Sorting in linear time?
- ACM Press, New York
- th ACM Symposium on Theory of Computing (STOC '95), pages 427-436. ACM Press, New York, 1995.
- (1995) th ACM Symposium on Theory of Computing (STOC '95) , pp. 427-436
- Andersson, A.¹ Hagerup, T.² Nilsson, S.³ Raman, R.⁴

3
- 0027634755
- Improved behaviour of tries by adaptive branching
- Arne Andersson and Stefan Nilsson. Improved behaviour of tries by adaptive branching. Information Processing Letters, 46:295-300, 1993.
- (1993) Information Processing Letters , pp. 295-300
- Andersson, A.¹ Nilsson, S.²

4
- 85011364350
- Faster searching in tries and quadtrees - An analysis of level compression
- nd Annual European Symposium on Algorithms (ESA '94), Springer-Verlag, Berlin
- nd Annual European Symposium on Algorithms (ESA '94), volume 855 of Lecture Notes in Computer Science, pages 82-93. Springer-Verlag, Berlin, 1994.
- (1994) Lecture Notes in Computer Science , vol.855 , pp. 82-93
- Andersson, A.¹ Nilsson, S.²

5
- 0029251238
- Efficient implementation of suffix trees
- Arne Andersson and Stefan Nilsson. Efficient implementation of suffix trees. Software - Practice and Experience, 25(2):129-141, 1995.
- (1995) Software - Practice and Experience , vol.25 , Issue.2 , pp. 129-141
- Andersson, A.¹ Nilsson, S.²

6
- 0002139526
- The myriad virtues of subword trees
- Alberto Apostolico and Zvi Galil, editors, NATO ISI Series, Springer-Verlag, New York.
- Alberto Apostolico. The myriad virtues of subword trees. In Alberto Apostolico and Zvi Galil, editors, Combinatorial Algorithms on Words, NATO ISI Series, pages 85-96. Springer-Verlag, New York. 1985.
- (1985) Combinatorial Algorithms on Words , pp. 85-96
- Apostolico, A.¹

7
- 84976715080
- Efficient text searching of regular expressions
- th International Colloquium on Automata. Languages and Programming (ICALP '89), Springer-Verlag, Berlin
- th International Colloquium on Automata. Languages and Programming (ICALP '89), volume 372 of Lecture Notes in Computer Science, pages 46-62. Springer-Verlag, Berlin, 1989.
- (1989) Lecture Notes in Computer Science , vol.372 , pp. 46-62
- Baeza-Yates, R.A.¹ Gonnet, G.H.²

8
- 0028483725
- Dynamic perfect hashing: Upper and lower bounds
- Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan. Dynamic perfect hashing: upper and lower bounds. SIAM Journal on Computing, 23(4):738-761, 1994.
- (1994) SIAM Journal on Computing , vol.23 , Issue.4 , pp. 738-761
- Dietzfelbinger, M.¹ Karlin, A.² Mehlhorn, K.³ Meyer, F.⁴ Rohnert, H.⁵ Tarjan, R.E.⁶

9
- 0031381052
- Optimal suffix tree construction with large alphabets
- October
- th IEEE Symposium on Foundations of Computer Science (FOCS '97), pages 137-143, October 1997.
- (1997) th IEEE Symposium on Foundations of Computer Science (FOCS '97) , pp. 137-143
- Farach, M.¹

10
- 0000743608
- Surpassing the information theoretic bound with fusion trees
- Michael L. Fredman and Dan E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 47:424-436, 1993.
- (1993) Journal of Computer and System Sciences , vol.47 , pp. 424-436
- Fredman, M.L.¹ Willard, D.E.²

11
- 0003915740
- Addison-Wesley, Reading, MA, ISBN 0-201-41607-7
- Gaston H. Gonnet and Ricardo A. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley, Reading, MA, 1991. ISBN 0-201-41607-7.
- (1991) Handbook of Algorithms and Data Structures
- Gonnet, G.H.¹ Baeza-Yates, R.A.²

12
- 0021426157
- Fast algorithms for finding nearest common ancestors
- Dov Harel and Robert E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338-355, 1984.
- (1984) SIAM Journal on Computing , Issue.2 , pp. 338-355
- Harel, D.¹ Tarjan, R.E.²

13
- 84948971495
- Sparse suffix trees
- nd International Conference on Computing and Combinatorics (COCOON '96), Springer-Verlag, Berlin
- nd International Conference on Computing and Combinatorics (COCOON '96), volume 1090 of Lecture Notes in Computer Science, pages 219-230. Springer-Verlag, Berlin, 1996.
- (1996) Lecture Notes in Computer Science , vol.1090 , pp. 219-230
- Kärkkäinen, J.¹ Ukkonen, E.²

14
- 0027681165
- Suffix arrays: A new method for on-line string searches
- October
- Udi Manber and Gene Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, October 1993.
- (1993) SIAM Journal on Computing , vol.22 , Issue.5 , pp. 935-948
- Manber, U.¹ Myers, G.²

15
- 0016942292
- A space-economical suffix tree construction algorithm
- Edward M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23:262-272, 1976.
- (1976) Journal of the ACM , vol.23 , pp. 262-272
- McCreight, E.M.¹

16
- 0027846339
- A generalized suffix tree and its (un)expected asymptotic behaviors
- December
- Wojciech Szpankowski. A generalized suffix tree and its (un)expected asymptotic behaviors. SIAM Journal on Computing, 22(6):1176-1198, December 1993.
- (1993) SIAM Journal on Computing , vol.22 , Issue.6 , pp. 1176-1198
- Szpankowski, W.¹

17
- 0001704377
- On-line construction of suffix trees
- September
- Esko Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, September 1995.
- (1995) Algorithmica , vol.14 , Issue.3 , pp. 249-260
- Ukkonen, E.¹

18
- 85043482370
- Linear pattern matching algorithms
- th IEEE Symposium on Foundations of Computer Science (FOCS '73), pages 1-11, 1973.
- (1973) th IEEE Symposium on Foundations of Computer Science (FOCS '73) , pp. 1-11
- Weiner, P.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.