{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T03:12:15Z","timestamp":1648523535221},"reference-count":3,"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> We present a first formal setting for suffix vectors that are space economical alternative data structures to suffix trees. We give two linear algorithms for converting a suffix tree into a suffix vector and conversely. We enrich suffix vectors with formulas for counting the number of occurrences of repeated substrings. We also propose an alternative implementation for suffix vectors that should outperform the existing one. <\/jats:p>","DOI":"10.1142\/s0129054106004479","type":"journal-article","created":{"date-parts":[[2006,12,13]],"date-time":"2006-12-13T07:02:04Z","timestamp":1165993324000},"page":"1385-1402","source":"Crossref","is-referenced-by-count":1,"title":["From Suffix Trees to Suffix Vectors"],"prefix":"10.1142","volume":"17","author":[{"given":"\u00c9lise","family":"Prieur","sequence":"first","affiliation":[{"name":"LITIS, University of Rouen, 76821 Mont-Saint-Aignan Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Lecroq","sequence":"additional","affiliation":[{"name":"LITIS, University of Rouen, 76821 Mont-Saint-Aignan Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O"},{"key":"rf3","first-page":"262","volume":"23","author":"McCreight E. M.","journal-title":"Journal of Algorithms"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106004479","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:27:40Z","timestamp":1565177260000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106004479"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":3,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1142\/S0129054106004479"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106004479","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}