Sorting suffixes of two-pattern strings

  title={Sorting suffixes of two-pattern strings},
  author={Frantisek Franek and William F. Smyth},
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial division of the suffixes of x into two sets: in step 1 sort the first set using recursive reduction of the problem, in step 2 determine the order of the suffixes in the second set based on the order of the suffixes in the first set, and in step 3 merge the two sets together. To optimize such an algorithm either for space… CONTINUE READING

From This Paper

Topics from this paper.
2 Citations
6 References
Similar Papers


Publications referenced by this paper.
Showing 1-6 of 6 references

Sorting suffixes of two-pattern strings

  • F. Franek, W. F. Smyth
  • Technical Report CAS-04-09-FF, Dept. of Comp…
  • 2004
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…