SPIRE 2009 International Symposium on String Processing and Information Retrieval
 |  |
Wall of Fame | Most Viewed SPIRE-2009 Paper
SPIRE
2009
Springer
13 years 11 months ago
2009
Springer
To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 139 | ||
| 2 | | 138 | ||
| 3 | | 131 | ||
| 4 | | 121 | ||
| 5 | | 114 | ||
| 6 | | 112 | ||
| 7 | | 104 | ||
| 8 | | 94 | ||
| 9 | | 92 | ||
| 10 | | 86 | ||
| 11 | | 85 | ||
| 12 | | 84 | ||
| 13 | | 83 | ||
| 14 | | 77 |