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

메뉴 건너뛰기

Volumn 14, Issue 3, 1995, Pages 249-260

On-line construction of suffix trees

(1) Ukkonen, E a

a UNIVERSITY OF HELSINKI (Finland)

Author keywords

DAWG; Linear time algorithm; Suffix automaton; Suffix tree; Suffix trie

Indexed keywords

EID: 0001704377 PISSN: 01784617 EISSN: 14320541 Source Type: Journal
DOI: 10.1007/BF01206331 Document Type: Article

Times cited : (1147)

References (13)

1
- 0016518897
- Efficient string matching: an aid to bibliographic search
- (1975) Comm. ACM , vol.18 , pp. 333-340
- Aho, A.¹ Corasick, M.²

2
- 84936697714
- A. Amir and M.Farach, Adaptive dictionary matching, Proc. 32nd IEEE Ann. Symp. on Foundations of Computer Science, 1991, pp. 760–766.

3
- 0002139526
- The myriad virtues of subword trees
- A., Apostolico, Z., Galil, Springer-Verlag, New York
- (1985) Combinatorial Algorithms on Words , pp. 85-95
- Apostolico, A.¹

4
- 0021483058
- The smallest automaton recognizing the subwords of a text
- (1985) Theoret. Comput. Sci. , vol.40 , pp. 31-55
- Blumer, A.¹ Blumer, J.² Haussier, D.³ Ehrenfeucht, A.⁴ Chen, M.T.⁵ Seiferas, J.⁶

5
- 0022865420
- Transducers and repetitions
- (1986) Theoret. Comput. Sci. , vol.45 , pp. 63-86
- Crochemore, M.¹

6
- 0002862696
- String matching with constraints
- M. P., Chytil, L., Janiga, V., Koubek, Lecture Notes in Computer Science, vol. 324, Springer-Verlag, Berlin
- (1988) Mathematical Foundations of Computer Science 1988 , pp. 44-58
- Crochemore, M.¹

7
- 0012743030
- Data structures and algorithms for approximate string matching
- (1988) J. Complexity , vol.4 , pp. 33-72
- Galil, Z.¹ Giancarlo, R.²

8
- 0023234903
- Time optimal left to right construction of position trees
- (1987) Acta Inform. , vol.24 , pp. 461-474
- Kempf, M.¹ Bayer, R.² Güntzer, U.³

9
- 0016942292
- A space-economical suffix tree construction algorithm
- (1976) J. Assoc. Comput. Mach. , vol.23 , pp. 262-272
- McCreight, E.¹

10
- 0006455454
- Constructing suffix trees on-line in linear time
- J., van Leeuwen, Elsevier, Amsterdam
- (1992) Algorithms, Software, Architecture. Information Processing 92, vol. I , pp. 484-492
- Ukkonen, E.¹

11
- 85026758927
- Approximate string-matching over suffix trees
- A., Apostolico, M., Crochemore, Z., Galil, U., Manber, Lecture Notes in Computer Science, vol. 684, Springer-Verlag, Berlin
- (1993) Combinatorial Pattern Matching, CPM '93 , pp. 228-242
- Ukkonen, E.¹

12
- 0027700453
- Approximate string matching with suffix automata
- (1993) Algorithmica , vol.10 , pp. 353-364
- Ukkonen, E.¹ Wood, D.²

13
- 84936697715
- P. Weiner, Linear pattern matching algorithms, Proc. IEEE 14th Ann. Symp. on Switching and Automata Theory, 1973, pp. 1–11.

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