{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T10:12:08Z","timestamp":1784887928457,"version":"3.55.0"},"reference-count":21,"publisher":"Oxford University Press (OUP)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,2,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: We present Rust-Bio, the first general purpose bioinformatics library for the innovative Rust programming language. Rust-Bio leverages the unique combination of speed, memory safety and high-level syntax offered by Rust to provide a fast and safe set of bioinformatics algorithms and data structures with a focus on sequence analysis.<\/jats:p>\n               <jats:p>Availability and implementation: Rust-Bio is available open source under the MIT license at https:\/\/rust-bio.github.io.<\/jats:p>\n               <jats:p>Contact: \u00a0koester@jimmy.harvard.edu<\/jats:p>\n               <jats:p>Supplementary information: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btv573","type":"journal-article","created":{"date-parts":[[2015,10,8]],"date-time":"2015-10-08T01:29:10Z","timestamp":1444267750000},"page":"444-446","source":"Crossref","is-referenced-by-count":68,"title":["Rust-Bio: a fast and safe bioinformatics library"],"prefix":"10.1093","volume":"32","author":[{"given":"Johannes","family":"K\u00f6ster","sequence":"first","affiliation":[{"name":"Center for Functional Cancer Epigenetics, Dana-Farber Cancer Institute, Department of Biostatistics and Computational Biology, Dana-Farber Cancer Institute, Harvard School of Public Health and Department of Medical Oncology, Dana-Farber Cancer Institute, Harvard Medical School, MA02215, Boston, USA."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2015,10,6]]},"reference":[{"key":"2023020110313077600_btv573-B1","first-page":"1","article-title":"Factor oracle: a new structure for pattern matching","volume":"1725","author":"Allauzen","year":"1999","journal-title":"Lect. Notes Comput. Sci."},{"issue":"124","key":"2023020110313077600_btv573-B2","first-page":"18","article-title":"A block-sorting lossless data compression algorithm","author":"Burrows","year":"1994","journal-title":"Algorithm Data Compression"},{"key":"2023020110313077600_btv573-B3","doi-asserted-by":"crossref","first-page":"1422","DOI":"10.1093\/bioinformatics\/btp163","article-title":"Biopython: freely available python tools for computational molecular biology and bioinformatics","volume":"25","author":"Cock","year":"2009","journal-title":"Bioinformatics"},{"key":"2023020110313077600_btv573-B4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1186\/1471-2105-9-11","article-title":"Seqan an efficient, generic C++ library for sequence analysis","volume":"9","author":"D\u00f6ring","year":"2008","journal-title":"BMC Bioinformatics"},{"key":"2023020110313077600_btv573-B5","first-page":"390","article-title":"Opportunistic data structures with applications","author":"Ferragina","year":"2000"},{"key":"2023020110313077600_btv573-B6","first-page":"27","article-title":"Practical implementation of rank and select queries","author":"Gonz\u00e1lez","year":"2005"},{"key":"2023020110313077600_btv573-B7","first-page":"14","article-title":"A bit-parallel approach to suffix automata: fast extended string matching","author":"Gonzalo Navarro","year":"1998"},{"key":"2023020110313077600_btv573-B8","doi-asserted-by":"crossref","first-page":"2617","DOI":"10.1093\/bioinformatics\/btq475","article-title":"Bioruby: bioinformatics software for the ruby programming language","volume":"26","author":"Goto","year":"2010","journal-title":"Bioinformatics"},{"key":"2023020110313077600_btv573-B9","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1002\/spe.4380100608","article-title":"Practical fast searching in strings","volume":"10","author":"Horspool","year":"1980","journal-title":"Softw. Pract. Exp."},{"key":"2023020110313077600_btv573-B10","author":"Jacobson","year":"1988"},{"key":"2023020110313077600_btv573-B11","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"2023020110313077600_btv573-B12","first-page":"75","article-title":"Llvm: A compilation framework for lifelong program analysis & transformation","author":"Lattner","year":"2004"},{"key":"2023020110313077600_btv573-B13","doi-asserted-by":"crossref","first-page":"1838","DOI":"10.1093\/bioinformatics\/bts280","article-title":"Exploring single-sample SNP and indel calling with whole-genome de novo assembly","volume":"28","author":"Li","year":"2012","journal-title":"Bioinformatics"},{"key":"2023020110313077600_btv573-B14","first-page":"935","article-title":"Suffix arrays: a new method for on-line string searches","volume-title":"SIAM Journal on Computing","author":"Manber","year":"1990"},{"key":"2023020110313077600_btv573-B15","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/316542.316550","article-title":"A fast bit-vector algorithm for approximate string matching based on dynamic programming","volume":"46","author":"Myers","year":"1999","journal-title":"J. ACM"},{"key":"2023020110313077600_btv573-B16","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","article-title":"A general method applicable to the search for similarities in the amino acid sequence of two proteins","volume":"48","author":"Needleman","year":"1970","journal-title":"J. Mol. Biol."},{"key":"2023020110313077600_btv573-B17","first-page":"193","article-title":"Linear suffix array construction by almost pure induced-sorting","author":"Nong","year":"2009"},{"key":"2023020110313077600_btv573-B18","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","article-title":"Identification of common molecular subsequences","volume":"147","author":"Smith","year":"1981","journal-title":"J. Mol. Biol."},{"key":"2023020110313077600_btv573-B19","doi-asserted-by":"crossref","first-page":"1611","DOI":"10.1101\/gr.361602","article-title":"The bioperl toolkit: Perl modules for the life sciences","volume":"12","author":"Stajich","year":"2002","journal-title":"Genome Res."},{"key":"2023020110313077600_btv573-B20","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","article-title":"Algorithms for approximate string matching","volume":"64","author":"Ukkonen","year":"1985","journal-title":"Inform. Control"},{"key":"2023020110313077600_btv573-B21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/135239.135244","article-title":"Fast text searching: allowing errors","volume":"35","author":"Wu","year":"1992","journal-title":"Commun. ACM"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/32\/3\/444\/49016785\/bioinformatics_32_3_444.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/32\/3\/444\/49016785\/bioinformatics_32_3_444.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T21:52:06Z","timestamp":1675288326000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/32\/3\/444\/1743419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,6]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,2,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btv573","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2016,2,1]]},"published":{"date-parts":[[2015,10,6]]}}}