The ADT proximity and text proximity problems

String Processing and Information Retrieval Symposium and International Workshop on Groupware, SPIRE 1999 and CRIWG 1999

Volumn , Issue , 1999, Pages 24-30

  Baeza Yates, Ricardo ^a   Cunto, Walter ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b Universidad Nacional Experimental Simon Rodriuez   (Venezuela)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DATA TYPES; ABSTRACTING; COMPUTER SOFTWARE; GROUPWARE; INFORMATION THEORY; SEARCH ENGINES;

BOOLEAN QUERIES; COMPLEXITY BOUNDS; TEXT RETRIEVAL;

INFORMATION RETRIEVAL;

EID: 0003427956     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.1999.796574     Document Type: Conference Paper

References (13)

1. A.V. Aho, D. Hirschberg, and J.D. Ullman. Bounds on the complexity of the longest common subse implementation quence problem. J.ACM 23:1-12, 1976.
2. M. Araüjo, G. Navarro, and N. Ziviani, Large Text Searching Allowing Errors, In Proc. WSP'97, Car leton University Press, 2-20, 1997.
3. R.A. Baeza-Yates. Efficient Text Searching. Ph.D. thesis, Dept. of Computer Science, University of Waterloo, May 1989. Also as Research Report CS-89-17.
4. R.A. Baeza-Yates and B. Ribeiro-Neto. Modern In-formation Retrieval, Addison-Wesley, 1999.
5. M.L. Friedman. How good is the information theory about sorting. Theor. Comp. Sc. 1:335-361, 1976.
6. G.H. Gonnet. PAT 3.1: An efficient text searching system, User's manual. Center for the New Oxford English Dictionary, University of Waterloo, 1987.
7. G.H. Gonnet and R. Baeza-Yates. Handbook of Al-gorithms and Data Structures, 2nd Edition. Addi algorithm. son Wesley, Wokingham, UK, 1991.
8. G.H. Gonnet, R. Baeza-Yates and T. Snider. New indices for text: PAT trees and PAT arrays. In Information Retrieval: Data Structures and Algo that rithms. Eds. W. Frakes and R. Baeza-Yates, 66-82, Prentice Hall, Englewood Cliffs, NJ, 1992.
9. R. Graham, D. Knuth, and 0. Patashnik. Concrete Mathematics. Addison-Wesley, Reading, Mass., 1989.
10. L.H. Harper, T.H. Payne, J.E. Savage and E. Straus. Sorting X+Y. Comm. ACM 18(6):347-349, 1975.
11. J.L. Lambert. Sorting the elements of X + Y in 0(n2) comparisons. In STACS'90, 195-206, 1990.
12. U. Manber and R. Baeza-Yates. An algorithm for string matching with a sequence of don't cares. In-formation Processing Letters 37:133-136, 1991.
13. U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. In SODA '90, 319-327, San Francisco, 1990.