This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
W. G. Aref, D. Barbara, S. Johnson, and S. Mehrotra. Efficient Processing of Proximity Queries for Large Databases. In Proceedings of 11th IEEE International Conference on Data Engineering, pages 147–154, 1995.
G.H. Gonnet, R. Baeza-Yates, and T. Snider. New Indices for Text: PAT trees and PAT arrays. In W. Frakes and R. Baeza-Yates, editors, Information Retrieval: Algorithms and Data Structures, chapter 5, pages 66–82. Prentice-Hall, 1992.
U. Manber and R. Baeza-Yates. An Algorithm for String Matching with a Sequence of Don’t Cares. Information Processing Letters, 37:133–136, February 1991.
F. Preparata and M. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sadakane, K., Imai, H. (1999). Finding Meaningful Regions Containing Given Keywords from Large Text Collections. In: Arikawa, S., Furukawa, K. (eds) Discovery Science. DS 1999. Lecture Notes in Computer Science(), vol 1721. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46846-3_45
Download citation
DOI: https://doi.org/10.1007/3-540-46846-3_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66713-1
Online ISBN: 978-3-540-46846-2
eBook Packages: Springer Book Archive