Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)

Abstract

Article Free Access Share on Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) Authors: Roberto Grossi Dipartimento di Informatica, Università di Pisa, 56125 Pisa, Italy Dipartimento di Informatica, Università di Pisa, 56125 Pisa, ItalyView Profile , Jeffrey Scott Vitter Department of Computer Science, Duke University, Durham, NC and I.N.R.I.A. in Sophia Antipolia, France Department of Computer Science, Duke University, Durham, NC and I.N.R.I.A. in Sophia Antipolia, FranceView Profile Authors Info & Claims STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computingMay 2000 Pages 397–406https://doi.org/10.1145/335305.335351Published:01 May 2000Publication History 178citation2,112DownloadsMetricsTotal Citations178Total Downloads2,112Last 12 Months127Last 6 weeks37 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF