A time and space efficient data structure for string searching on large texts

Information Processing Letters

Volumn 58, Issue 5, 1996, Pages 217-222

  Colussi, Livio ^a   De Col, Alessia ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

Algorithms; Data structures; String matching

Indexed keywords

EID: 0042022841     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00061-0     Document Type: Article

References (8)

1. A. Anderson and S. Nilsson, Efficient implementation of suffix trees. Software - Practice and Experience 25 (2) (1995) 129-141.
2. A. Apostolico, The myriad virtues of subword trees, in: A. Apostolico and Z. Galil, eds., Combinatorial Algorithms on Words (Springer, Berlin, 1985) 85-95.
3. E.M. McCreight, A space-economical suffix tree construction algorithm, J. ACM 23 (2) (1976) 262-272.
4. M. Crochemore and W. Rytter, Text Algorithms (The Clarendon Press, Oxford University Press, New York, 1994).
5. R.W. Irving, Suffix binary search trees. Tech. Rept. TR-19957, Computer Science Dept., University of Glasgow, 1995.
6. J. Kärkkäinen, Suffix cactus: A cross between suffix tree and suffix array, in: Proc. CPM'95 (1995) 262-272.
7. U. Mamber and G. Myers, Suffix arrays: A new method for on-line string searches, in: SIAM J. Comput. 22 (5) (1993) 935-948.
8. P. Weiner, Linear pattern matching algorithms, in: Proc. IEEE 14th Ann. Symp. on Switching and Automata Theory (1973) 1-11.