15 search results - page 1 / 3 » In-Place Suffix Sorting |
ICALP
2007
Springer
13 years 10 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
HPCC
2007
Springer
14 years 29 days ago
2007
Springer
Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this pape...
FCT
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We present an algorithm for asymptotically efficient multiway blockwise in-place merging. Given an array A containing sorted subsequences A1, . . . , Ak of respective le...
USENIX
2003
13 years 8 months ago
2003
The open-source rsync utility reduces the time and bandwidth required to update a file across a network. Rsync uses an interactive protocol that detects changes in a file and se...
SODA
1990
ACM
13 years 8 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...