Efficient Algorithms for Similarity Search

Journal of Combinatorial Optimization

Volumn 5, Issue 1, 2001, Pages 125-132

  Rajasekaran, S ^a   Hu, Y ^a   Luo, J ^a   Nick, H ^b   Pardalos, P M ^a   Sahni, S ^a   Shaw, G ^b  

^a UNIVERSITY OF FLORIDA   (United States)

^b UNIVERSITY OF FLORIDA COLLEGE OF MEDICINE   (United States)

Author keywords

Color set size (CSS); Generalized suffix tree (GST); Quick sort; Radix sort

Indexed keywords

EID: 0042784138     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009897903540     Document Type: Article

References (5)

1. L. Chi and K. Hui, "Color set size problem with applications to string matching," Technical Report, Dept. of Computer Science, University of California, Davis, 1992.
2. E. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms, W.H. Freeman Press, New York, NY, 1998.
3. M. Nelson, "Fast string searching with suffix trees," Dr. Dobb's Journal, Aug. 1996.
4. B. Schieber and U. Vishkin, "On finding lowest common ancestors: Simplification and parallelization," SIAM J. Comput., vol. 17, no. 6, pp. 1253-1262, 1988.
5. E. Ukkonen, "On-line construction of suffix trees," Algorithmica, vol. 14, no. 3, pp. 249-260, 1995.