![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Yuanyuan Tian Yuanyuan Tian, Sandeep Tata , Richard A. Hankins , Jignesh M. Patel : Practical methods for constructing suffix trees. VLDB J. 14 (3): 281-299 (2005) 1 [ 1 ] 2 [ 1 ] 3 [ 1 ] ![]() ©2006 Association for Computing Machinery |