{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:21Z","timestamp":1761611241096},"reference-count":12,"publisher":"Oxford University Press (OUP)","issue":"8","license":[{"start":{"date-parts":[[2016,10,2]],"date-time":"2016-10-02T00:00:00Z","timestamp":1475366400000},"content-version":"vor","delay-in-days":2775,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.0\/uk\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,4,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: We introduce the tool mkESA, an open source program for constructing enhanced suffix arrays (ESAs), striving for low memory consumption, yet high practical speed. mkESA is a user-friendly program written in portable C99, based on a parallelized version of the Deep-Shallow suffix array construction algorithm, which is known for its high speed and small memory usage. The tool handles large FASTA files with multiple sequences, and computes suffix arrays and various additional tables, such as the LCP table (longest common prefix) or the inverse suffix array, from given sequence data.<\/jats:p>\n               <jats:p>Availability: The source code of mkESA is freely available under the terms of the GNU General Public License (GPL) version 2 at http:\/\/bibiserv.techfak.uni-bielefeld.de\/mkesa\/.<\/jats:p>\n               <jats:p>Contact: \u00a0rhomann@techfak.uni-bielefeld.de<\/jats:p>","DOI":"10.1093\/bioinformatics\/btp112","type":"journal-article","created":{"date-parts":[[2009,2,27]],"date-time":"2009-02-27T01:48:47Z","timestamp":1235699327000},"page":"1084-1085","source":"Crossref","is-referenced-by-count":22,"title":["<i>mkESA<\/i>: enhanced suffix array construction tool"],"prefix":"10.1093","volume":"25","author":[{"given":"Robert","family":"Homann","sequence":"first","affiliation":[{"name":"1 International NRW Graduate School in Bioinformatics and Genome Research, Center for Biotechnology (CeBiTec), Bielefeld University, 33594 Bielefeld, 2Technische Fakult\u00e4t, Bielefeld University, Postfach 100 131, 33501, Bielefeld, Germany and 3GMI - Gregor Mendel Institute of Molecular Plant Biology GmbH, Dr. Bohr-Gasse 3, 1030 Vienna, Austria"},{"name":"1 International NRW Graduate School in Bioinformatics and Genome Research, Center for Biotechnology (CeBiTec), Bielefeld University, 33594 Bielefeld, 2Technische Fakult\u00e4t, Bielefeld University, Postfach 100 131, 33501, Bielefeld, Germany and 3GMI - Gregor Mendel Institute of Molecular Plant Biology GmbH, Dr. Bohr-Gasse 3, 1030 Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Fleer","sequence":"additional","affiliation":[{"name":"1 International NRW Graduate School in Bioinformatics and Genome Research, Center for Biotechnology (CeBiTec), Bielefeld University, 33594 Bielefeld, 2Technische Fakult\u00e4t, Bielefeld University, Postfach 100 131, 33501, Bielefeld, Germany and 3GMI - Gregor Mendel Institute of Molecular Plant Biology GmbH, Dr. Bohr-Gasse 3, 1030 Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Giegerich","sequence":"additional","affiliation":[{"name":"1 International NRW Graduate School in Bioinformatics and Genome Research, Center for Biotechnology (CeBiTec), Bielefeld University, 33594 Bielefeld, 2Technische Fakult\u00e4t, Bielefeld University, Postfach 100 131, 33501, Bielefeld, Germany and 3GMI - Gregor Mendel Institute of Molecular Plant Biology GmbH, Dr. Bohr-Gasse 3, 1030 Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Rehmsmeier","sequence":"additional","affiliation":[{"name":"1 International NRW Graduate School in Bioinformatics and Genome Research, Center for Biotechnology (CeBiTec), Bielefeld University, 33594 Bielefeld, 2Technische Fakult\u00e4t, Bielefeld University, Postfach 100 131, 33501, Bielefeld, Germany and 3GMI - Gregor Mendel Institute of Molecular Plant Biology GmbH, Dr. Bohr-Gasse 3, 1030 Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2009,2,26]]},"reference":[{"key":"2023051607022489800_B1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","article-title":"Replacing suffix trees with enhanced suffix arrays","volume":"2","author":"Abouelhoda","year":"2004","journal-title":"J. Discrete Algorithms"},{"key":"2023051607022489800_B2","doi-asserted-by":"crossref","DOI":"10.1186\/1471-2105-7-389","article-title":"Fast index based algorithms and software for matching position specific scoring matrices","volume":"7","author":"Beckstette","year":"2006","journal-title":"BMC Bioinformatics"},{"key":"2023051607022489800_B3","doi-asserted-by":"crossref","first-page":"i174","DOI":"10.1093\/bioinformatics\/btn300","article-title":"Optimal spliced alignments of short sequence reads","volume":"24","author":"De Bona","year":"2008","journal-title":"Bioinformatics"},{"key":"2023051607022489800_B4","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1002\/spe.535","article-title":"Efficient implementation of lazy suffix trees","volume":"33","author":"Giegerich","year":"2003","journal-title":"Softw. Pract. Exp."},{"key":"2023051607022489800_B5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology.","author":"Gusfield","year":"1997"},{"key":"2023051607022489800_B6","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":"2023051607022489800_B7","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1093\/bioinformatics\/btm039","article-title":"Gepard: a rapid and sensitive tool for creating dotplots on genome scale","volume":"23","author":"Krumsiek","year":"2007","journal-title":"Bioinformatics"},{"key":"2023051607022489800_B8","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":"2023051607022489800_B9","first-page":"372","article-title":"Two space saving tricks for linear time LCP array computation","volume-title":"Proceedings of 9th Scandinavian Workshop on Algorithm Theory (SWAT '04)","author":"Manzini","year":"2004"},{"key":"2023051607022489800_B10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s00453-004-1094-1","article-title":"Engineering a lightweight suffix array construction algorithm","volume":"40","author":"Manzini","year":"2004","journal-title":"Algorithmica"},{"key":"2023051607022489800_B11","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/1242471.1242472","article-title":"A taxonomy of suffix array construction algorithms","volume":"39","author":"Puglisi","year":"2007","journal-title":"ACM Comput. Surv."},{"key":"2023051607022489800_B12","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1142\/S0219720003000125","article-title":"Fast large scale oligonucleotide selection using the longest common factor approach","volume":"1","author":"Rahmann","year":"2003","journal-title":"J. Bioinform. Comput. Biol."}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/25\/8\/1084\/50287490\/bioinformatics_25_8_1084.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/25\/8\/1084\/50287490\/bioinformatics_25_8_1084.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T07:07:00Z","timestamp":1684220820000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/25\/8\/1084\/324902"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,26]]},"references-count":12,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2009,4,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btp112","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2009,4,15]]},"published":{"date-parts":[[2009,2,26]]}}}