Published in
Springer, Lecture Notes in Computer Science, p. 138-149, 2004
DOI: 10.1007/978-3-540-30213-1_22
Links
Tools
An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size
This paper was not found in any repository, but could be made available legally by the author.
Full text: Unavailable
Preprint: archiving forbidden
Published version:
archiving forbidden
Data provided by 