Search engine indexing: Difference between revisions

Content deleted Content added
BattyBot (talk | contribs)
Line 29:
| title = Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology
| publisher = Cambridge University Press
| ___location = USAUS
| isbn = 0-521-58519-8}}.
</ref> An alternate representation is a [[suffix array]], which is considered to require less virtual memory and supports data compression such as the [[Burrows–Wheeler transform|BWT]] algorithm.