{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:21Z","timestamp":1759637901977},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p> For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a suffix tree or suffix array should occur in lexicographical order (lexorder). It thus becomes of interest to study possible alternate orderings of the suffixes in these data structures, that may be easier to construct or more efficient to use. In this paper we consider the \"reconstruction\" of a suffix array based on a given reordering of the alphabet, and we describe simple time- and space-efficient algorithms that accomplish it. <\/jats:p>","DOI":"10.1142\/s0129054106004418","type":"journal-article","created":{"date-parts":[[2006,12,13]],"date-time":"2006-12-13T12:02:04Z","timestamp":1166011324000},"page":"1281-1295","source":"Crossref","is-referenced-by-count":8,"title":["RECONSTRUCTING A SUFFIX ARRAY"],"prefix":"10.1142","volume":"17","author":[{"given":"FRANTISEK","family":"FRANEK","sequence":"first","affiliation":[{"name":"Department of Computing and Software, Mcmaster University, Hamilton, Ontario L8S 4K1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"WILLIAM F.","family":"SMYTH","sequence":"additional","affiliation":[{"name":"Department of Computing and Software, Mcmaster University, Hamilton, Ontario L8S 4K1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf6","first-page":"593","volume":"8","author":"Franek F.","journal-title":"J. Automata, Languages & Combinatorics"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1094-1"},{"key":"rf21","unstructured":"B.\u00a0Smyth, Computing Patterns in Strings (Pearson Addison-Wesley, 2003)\u00a0p. 423."}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106004418","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:27:29Z","timestamp":1565191649000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106004418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":4,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1142\/S0129054106004418"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106004418","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}