Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2207.00972 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913312363511808 |
|---|---|
| author | Lipták, Zsuzsanna Masillo, Francesco Puglisi, Simon J. |
| author_facet | Lipták, Zsuzsanna Masillo, Francesco Puglisi, Simon J. |
| contents | We introduce a new algorithm for constructing the generalized suffix array of a collection of highly similar strings. As a first step, we construct a compressed representation of the matching statistics of the collection with respect to a reference string. We then use this data structure to distribute suffixes into a partial order, and subsequently to speed up suffix comparisons to complete the generalized suffix array. Our experimental evidence with a prototype implementation (a tool we call sacamats) shows that on string collections with highly similar strings we can construct the suffix array in time competitive with or faster than the fastest available methods. Along the way, we describe a heuristic for fast computation of the matching statistics of two strings, which may be of independent interest. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2207_00972 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Suffix sorting via matching statistics Lipták, Zsuzsanna Masillo, Francesco Puglisi, Simon J. Data Structures and Algorithms We introduce a new algorithm for constructing the generalized suffix array of a collection of highly similar strings. As a first step, we construct a compressed representation of the matching statistics of the collection with respect to a reference string. We then use this data structure to distribute suffixes into a partial order, and subsequently to speed up suffix comparisons to complete the generalized suffix array. Our experimental evidence with a prototype implementation (a tool we call sacamats) shows that on string collections with highly similar strings we can construct the suffix array in time competitive with or faster than the fastest available methods. Along the way, we describe a heuristic for fast computation of the matching statistics of two strings, which may be of independent interest. |
| title | Suffix sorting via matching statistics |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2207.00972 |