Compressed Suffix Arrays and Suffix Trees, with Applications to Text Indexing and String Matching
Published in Papers/Documentation, Suffix Trees
R. Grossi and J. S. Vitter. “Compressed Suffix Arrays and Suffix Trees, with Applications to Text Indexing and String Matching,” Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC ‘00), Portland, OR, May 2000, 397-406.
http://www.cs.duke.edu/~jsv/Papers/catalog/node79.html
Posted in April 8th, 2002
No User Commented In " Compressed Suffix Arrays and Suffix Trees, with Applications to Text Indexing and String Matching "
Subscribes to this post Comment RSS or TrackBack URL
