{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T03:47:03Z","timestamp":1772509623611,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s1570-8667(03)00065-0","type":"journal-article","created":{"date-parts":[[2004,2,28]],"date-time":"2004-02-28T05:31:19Z","timestamp":1077946279000},"page":"53-86","source":"Crossref","is-referenced-by-count":511,"title":["Replacing suffix trees with enhanced suffix arrays"],"prefix":"10.1016","volume":"2","author":[{"given":"Mohamed Ibrahim","family":"Abouelhoda","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Kurtz","sequence":"additional","affiliation":[]},{"given":"Enno","family":"Ohlebusch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1570-8667(03)00065-0_BIB001","series-title":"Proc. Workshop on Algorithms in Bioinformatics","first-page":"449","article-title":"The enhanced suffix array and its applications to genome analysis","volume":"vol. 2452","author":"Abouelhoda","year":"2002"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB002","series-title":"Proc. International Symposium on String Processing and Information Retrieval","first-page":"31","article-title":"Optimal exact string matching based on suffix arrays","volume":"vol. 2476","author":"Abouelhoda","year":"2002"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB003","series-title":"Combinatorial Algorithms on Words","first-page":"85","article-title":"The myriad virtues of subword trees","author":"Apostolico","year":"1985"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB004","series-title":"Proc. Latin American Theoretical Informatics","first-page":"88","article-title":"The LCA problem revisited","author":"Bender","year":"2000"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB005","series-title":"Proc. ACM-SIAM Symposium on Discrete Algorithms","first-page":"360","article-title":"Fast algorithms for sorting and searching strings","author":"Bentley","year":"1997"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB006","unstructured":"M. Burrows, D.J. Wheeler, A block-sorting lossless data compression algorithm, Research Report 124, Digital Systems Research Center, 1994"},{"issue":"4\u20135","key":"10.1016\/S1570-8667(03)00065-0_BIB007","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01185431","article-title":"Sublinear approximate string matching and biological applications","volume":"12","author":"Chang","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB008","doi-asserted-by":"crossref","first-page":"2369","DOI":"10.1093\/nar\/27.11.2369","article-title":"Alignment of whole genomes","volume":"27","author":"Delcher","year":"1999","journal-title":"Nucl. Acids Res."},{"issue":"11","key":"10.1016\/S1570-8667(03)00065-0_BIB009","doi-asserted-by":"crossref","first-page":"2478","DOI":"10.1093\/nar\/30.11.2478","article-title":"Fast algorithms for large-scale genome alignment and comparison","volume":"30","author":"Delcher","year":"2002","journal-title":"Nucl. Acids Res."},{"key":"10.1016\/S1570-8667(03)00065-0_BIB010","series-title":"Proc. IEEE Symposium on Foundations of Computer Science","first-page":"390","article-title":"Opportunistic data structures with applications","author":"Ferragina","year":"2000"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB011","series-title":"Proc. ACM-SIAM Symposium on Discrete Algorithms","first-page":"269","article-title":"An experimental study of an opportunistic index","author":"Ferragina","year":"2001"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB012","unstructured":"P. Ferragina, G. Manzini, On compressing and indexing data, Technical Report TR-02-01, Dipartimento di Informatica, Universit\u00e0 di Pisa, 2002"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB013","series-title":"Information Retrieval: Algorithms and Data Structures","first-page":"66","article-title":"New indices for text: PAT trees and PAT arrays","author":"Gonnet","year":"1992"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB014","series-title":"Proc. ACM Symposium on the Theory of Computing","first-page":"397","article-title":"Compressed suffix arrays and suffix trees with applications to text indexing and string matching","author":"Grossi","year":"2000"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB015","series-title":"Algorithms on Strings, Trees, and Sequences","author":"Gusfield","year":"1997"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB016","unstructured":"D. Gusfield, J. Stoye, Linear time algorithms for finding and representing all the tandem repeats in a string, Report CSE-98-4, Computer Science Division, University of California, Davis, 1998"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB017","doi-asserted-by":"crossref","first-page":"S312","DOI":"10.1093\/bioinformatics\/18.suppl_1.S312","article-title":"Efficient multiple genome alignment","volume":"18","author":"H\u00f6hl","year":"2002","journal-title":"Bioinformatics"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB018","series-title":"Proc. Annual Symposium on Combinatorial Pattern Matching","first-page":"144","article-title":"Space-economical algorithms for finding maximal unique matches","volume":"vol. 2373","author":"Hon","year":"2002"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB019","series-title":"Proc. International Colloquium on Automata, Languages and Programming","first-page":"943","article-title":"Simple linear work suffix array construction","volume":"vol. 2719","author":"K\u00e4rkk\u00e4inen","year":"2003"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB020","series-title":"Proc. Annual Symposium on Combinatorial Pattern Matching","first-page":"181","article-title":"Linear-time longest-common-prefix computation in suffix arrays and its applications","volume":"vol. 2089","author":"Kasai","year":"2001"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB021","series-title":"Proc. Annual Symposium on Combinatorial Pattern Matching","first-page":"186","article-title":"Linear-time construction of suffix arrays","volume":"vol. 2676","author":"Kim","year":"2003"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB022","author":"Knight"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB023","series-title":"Proc. Annual Symposium on Combinatorial Pattern Matching","first-page":"200","article-title":"Space efficient linear time construction of suffix arrays","volume":"vol. 2676","author":"Ko","year":"2003"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB024","series-title":"Proc. Symposium on Foundations of Computer Science","first-page":"596","article-title":"Finding maximal repetitions in a word in linear time","author":"Kolpakov","year":"1999"},{"issue":"13","key":"10.1016\/S1570-8667(03)00065-0_BIB025","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","article-title":"Reducing the space requirement of suffix trees","volume":"29","author":"Kurtz","year":"1999","journal-title":"Software\u2014Practice and Experience"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB026","unstructured":"S. Kurtz, A time and space efficient algorithm for the substring matching problem, Technical Report, Zentrum f\u00fcr Bioinformatik, Universit\u00e4t Hamburg, 2003"},{"issue":"22","key":"10.1016\/S1570-8667(03)00065-0_BIB027","doi-asserted-by":"crossref","first-page":"4633","DOI":"10.1093\/nar\/29.22.4633","article-title":"REPuter: the manifold applications of repeat analysis on a genomic scale","volume":"29","author":"Kurtz","year":"2001","journal-title":"Nucl. Acids Res."},{"key":"10.1016\/S1570-8667(03)00065-0_BIB028","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1038\/35057062","article-title":"Initial sequencing and analysis of the human genome","volume":"409","author":"Lander","year":"2001","journal-title":"Nature"},{"issue":"5","key":"10.1016\/S1570-8667(03)00065-0_BIB029","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","article-title":"Suffix arrays: a new method for on-line string searches","volume":"22","author":"Manber","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S1570-8667(03)00065-0_BIB030","series-title":"Comparative Genomics","first-page":"29","article-title":"The pathological consequences and evolutionary implications of recent human genomic duplications","author":"O'Keefe","year":"2000"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB031","series-title":"Proc. ACM-SIAM Symposium on Discrete Algorithms","first-page":"225","article-title":"Succinct representations of lcp information and improvements in the compressed suffix arrays","author":"Sadakane","year":"2002"},{"key":"10.1016\/S1570-8667(03)00065-0_BIB032","series-title":"Proc. IEEE Annual Symposium on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973"},{"issue":"3","key":"10.1016\/S1570-8667(03)00065-0_BIB033","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"23","author":"Ziv","year":"1977","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"10.1016\/S1570-8667(03)00065-0_BIB034","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable length coding","volume":"24","author":"Ziv","year":"1978","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000650?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000650?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T17:56:18Z","timestamp":1550166978000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866703000650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S1570866703000650"],"URL":"https:\/\/doi.org\/10.1016\/s1570-8667(03)00065-0","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}