Show simple item record

dc.contributor.authorFranek, F.
dc.contributor.authorSmyth, Bill
dc.contributor.editorMilan Simanek
dc.contributor.editorJan Holub
dc.identifier.citationFranek, Frantisek and Smyth, W. 2004. Sorting suffixes of two-pattern strings, in Simanek, M. and Holub, J. (ed), Prague Stringology Conference, pp. 69-78. Prague. Czech Republic: Vydavatelstvi CVUT.

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 analgorithm either for space or time, it may not be sufficient to optimize one of the three steps, since in doing so, one might increase the resources required for the others to an unacceptable extent. Franek, Lu, and Smyth introduced two-pattern strings as a generalization of Sturmian strings. Like Sturmian strings, two-pattern strings are generated by iterated morphisms, but they exhibit a much richer structure. In this paper we show that the suffixes of two-pattern strings can be sorted in linear time using a variant of the three step approach outlined above. It turns out that, given the order of the suffixes in a two-pattern string, one can almost directly list in linear time all the suffixes of its expansion under a two-pattern morphism.

dc.publisherVydavatelstvi CVUT
dc.titleSorting suffixes of two-pattern strings
dc.typeConference Paper
dcterms.source.titleProceedings of the Prague Stringology Conference
dcterms.source.seriesProceedings of the Prague Stringology Conference
dcterms.source.conferencePrague Stringology Conference
dcterms.source.conference-start-dateAug 30 2004
dcterms.source.conferencelocationPrague, Czech Republic
dcterms.source.placeCzech Republic
curtin.departmentDigital Ecosystems and Business Intelligence Institute (DEBII)
curtin.accessStatusOpen access
curtin.facultyCurtin Business School
curtin.facultyThe Digital Ecosystems and Business Intelligence Institute (DEBII)

Files in this item


This item appears in the following Collection(s)

Show simple item record