{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:01Z","timestamp":1760202541293},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442110"},{"type":"electronic","value":"9783540457848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45784-4_35","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T14:33:38Z","timestamp":1192545218000},"page":"449-463","source":"Crossref","is-referenced-by-count":47,"title":["The Enhanced Suffix Array and Its Applications to Genome Analysis"],"prefix":"10.1007","author":[{"given":"Mohamed Ibrahim","family":"Abouelhoda","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Kurtz","sequence":"additional","affiliation":[]},{"given":"Enno","family":"Ohlebusch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"35_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Optimal Exact String Matching Based on Suffix Arrays","author":"M.I. Abouelhoda","year":"2002","unstructured":"M.I. Abouelhoda, E. Ohlebusch, and S. Kurtz. Optimal Exact String Matching Based on Suffix Arrays. In Proceedings of the Ninth International Symposium on String Processing and Information Retrieval. Springer-Verlag, Lecture Notes in Computer Science, 2002."},{"doi-asserted-by":"crossref","unstructured":"A. Apostolico. The Myriad Virtues of Subword Trees. In Combinatorial Algorithms on Words, Springer-Verlag, pages 85\u201396, 1985.","key":"35_CR2","DOI":"10.1007\/978-3-642-82456-2_6"},{"unstructured":"J. Bentley and R. Sedgewick. Fast Algorithms for Sorting and Searching Strings. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 360\u2013369, 1997.","key":"35_CR3"},{"unstructured":"M. Burrows and D.J. Wheeler. A Block-Sorting Lossless Data Compression Algorithm. Research Report 124, Digital Systems Research Center, 1994.","key":"35_CR4"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1093\/nar\/27.11.2369","volume":"27","author":"A.L. Delcher","year":"1999","unstructured":"A.L. Delcher, S. Kasif, R.D. Fleischmann, J. Peterson, O. White, and S.L. Salzberg. Alignment of Whole Genomes. Nucleic Acids Res., 27:2369\u20132376, 1999.","journal-title":"Nucleic Acids Res."},{"issue":"6","key":"35_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/gb-2000-1-6-research0011","volume":"1","author":"J. A. Eisen","year":"2000","unstructured":"J. A. Eisen, J. F. Heidelberg, O. White, and S.L. Salzberg. Evidence for Symmetric Chromosomal Inversions Around the Replication Origin in Bacteria. Genome Biology, 1(6):1\u20139, 2000.","journal-title":"Genome Biology"},{"key":"35_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York, 1997."},{"unstructured":"D. Gusfield and 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":"35_CR8"},{"key":"35_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and its Applications","author":"T. Kasai","year":"2001","unstructured":"T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park. Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and its Applications. In Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, pages 181\u2013192. Lecture Notes in Computer Science 2089, Springer-Verlag, 2001."},{"unstructured":"J. Knight, D. Gusfield, and J. Stoye. The Strmat Software-Package, 1998. \n                  http:\/\/www.cs.ucdavis.edu\/ gus.eld\/strmat.tar.gz\n                  \n                .","key":"35_CR10"},{"doi-asserted-by":"crossref","unstructured":"R. Kolpakov and G. Kucherov. Finding Maximal Repetitions in a Word in Linear Time. In Symposium on Foundations of Computer Science, pages 596\u2013604. IEEE Computer Society, 1999.","key":"35_CR11","DOI":"10.1109\/SFFCS.1999.814634"},{"issue":"13","key":"35_CR12","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","volume":"29","author":"S. Kurtz","year":"1999","unstructured":"S. Kurtz. Reducing the Space Requirement of Suffix Trees. Software\u2014Practice and Experience, 29(13):1149\u20131171, 1999.","journal-title":"Software\u2014Practice and Experience"},{"issue":"22","key":"35_CR13","doi-asserted-by":"publisher","first-page":"4633","DOI":"10.1093\/nar\/29.22.4633","volume":"29","author":"S. Kurtz","year":"2001","unstructured":"S. Kurtz, J.V. Choudhuri, E. Ohlebusch, C. Schleiermacher, J. Stoye, and R. Giegerich. REPuter: The Manifold Applications of Repeat Analysis on a Genomic Scale. Nucleic Acids Res., 29(22):4633\u20134642, 2001.","journal-title":"Nucleic Acids Res."},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1038\/35057062","volume":"409","author":"E.S. Lander","year":"2001","unstructured":"E.S. Lander, L.M. Linton, B. Birren, C. Nusbaum, M.C. Zody, J. Baldwin, K. Devon, and K. Dewar, et. al. Initial Sequencing and Analysis of the Human Genome. Nature, 409:860\u2013921, 2001.","journal-title":"Nature"},{"unstructured":"N.J. Larsson and K. Sadakane. Faster Suffix Sorting. Technical Report LU-CSTR: 99-214, Dept. of Computer Science, Lund University, 1999.","key":"35_CR15"},{"issue":"5","key":"35_CR16","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"U. Manber and E.W. Myers. Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing, 22(5):935\u2013948, 1993.","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"C. O\u2019Keefe and E. Eichler. The Pathological Consequences and Evolutionary Implications of Recent Human Genomic Duplications. In Comparative Genomics, pages 29\u201346. Kluwer Press, 2000.","key":"35_CR17","DOI":"10.1007\/978-94-011-4309-7_5"},{"issue":"1\u20132","key":"35_CR18","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/S0304-3975(01)00121-9","volume":"270","author":"J. Stoye","year":"2002","unstructured":"J. Stoye and D. Gusffield. Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree. Theoretical Computer Science, 270(1\u20132):843\u2013856, 2002.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45784-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T07:28:15Z","timestamp":1550993295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45784-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442110","9783540457848"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45784-4_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}