{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T09:04:07Z","timestamp":1778144647748,"version":"3.51.4"},"reference-count":50,"publisher":"Public Library of Science (PLoS)","issue":"10","license":[{"start":{"date-parts":[[2016,10,19]],"date-time":"2016-10-19T00:00:00Z","timestamp":1476835200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["www.ploscompbiol.org"],"crossmark-restriction":false},"short-container-title":["PLoS Comput Biol"],"DOI":"10.1371\/journal.pcbi.1005107","type":"journal-article","created":{"date-parts":[[2016,10,19]],"date-time":"2016-10-19T17:41:35Z","timestamp":1476898895000},"page":"e1005107","update-policy":"https:\/\/doi.org\/10.1371\/journal.pcbi.corrections_policy","source":"Crossref","is-referenced-by-count":37,"title":["rasbhari: Optimizing Spaced Seeds for Database Searching, Read Mapping and Alignment-Free Sequence Comparison"],"prefix":"10.1371","volume":"12","author":[{"given":"Lars","family":"Hahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris-Andr\u00e9","family":"Leimeister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1803-261X","authenticated-orcid":true,"given":"Rachid","family":"Ounit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2696-7274","authenticated-orcid":true,"given":"Stefano","family":"Lonardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burkhard","family":"Morgenstern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"340","published-online":{"date-parts":[[2016,10,19]]},"reference":[{"key":"ref1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","article-title":"Basic Local Alignment Search Tool","volume":"215","author":"SF Altschul","year":"1990","journal-title":"Journal of Molecular Biology"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1089\/cmb.2012.0022","article-title":"Mapping Reads on a Genomic Sequence: An Algorithmic Overview and a Practical Comparative Analysis","volume":"19","author":"S Schbath","year":"2012","journal-title":"Journal of Computational Biology"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"i349","DOI":"10.1093\/bioinformatics\/btu439","article-title":"Lambda: the local aligner for massive biological data","volume":"30","author":"H Hauswedell","year":"2014","journal-title":"Bioinformatics"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"R108","DOI":"10.1186\/gb-2009-10-10-r108","article-title":"Genomic DNA <italic>k<\/italic>-mer spectra: models and modalities","volume":"10","author":"B Chor","year":"2009","journal-title":"Genome Biology"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"2677","DOI":"10.1073\/pnas.0813249106","article-title":"Alignment-free genome comparison with feature frequency profiles (FFP) and optimal resolutions","volume":"106","author":"GE Sims","year":"2009","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1186\/1748-7188-7-10","article-title":"Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis","volume":"7","author":"S Vinga","year":"2012","journal-title":"Algorithms for Molecular Biology"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1073\/pnas.0913033107","article-title":"Whole-proteome phylogeny of prokaryotes by feature frequency profiles: An alignment-free method with optimal feature resolution","volume":"107","author":"SR Jun","year":"2010","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"ref8","unstructured":"Allman ES, Rhodes JA, Sullivant S. Statistically-Consistent <italic>k<\/italic>-mer Methods for Phylogenetic Tree Reconstruction. arXiv:151101956 [q-bioPE];."},{"key":"ref9","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1093\/bib\/bbu005","article-title":"Editorial: Alignment-free methods in computational biology","volume":"15","author":"S Vinga","year":"2014","journal-title":"Briefings in Bioinformatics"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1093\/bioinformatics\/btg431","article-title":"Mismatch string kernels for discriminative protein classification","volume":"20","author":"CS Leslie","year":"2004","journal-title":"Bioinformatics"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1186\/s12864-015-1419-2","article-title":"CLARK: fast and accurate classification of metagenomic and genomic sequences using discriminative <italic>k<\/italic>-mers","volume":"16","author":"R Ounit","year":"2015","journal-title":"BMC Genomics"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1382","DOI":"10.1093\/bioinformatics\/btu843","article-title":"UProC: tools for ultra-fast protein domain classification","volume":"31","author":"P Meinicke","year":"2015","journal-title":"Bioinformatics"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1186\/1471-2105-5-169","article-title":"Oligo kernels for datamining on biological sequences: a case study on prokaryotic translation initiation sites","volume":"5","author":"P Meinicke","year":"2004","journal-title":"BMC Bioinformatics"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"2224","DOI":"10.1093\/bioinformatics\/btl376","article-title":"Remote homology detection based on oligomer distances","volume":"22","author":"T Lingner","year":"2006","journal-title":"Bioinformatics"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1093\/bioinformatics\/18.3.440","article-title":"PatternHunter: faster and more sensitive homology search","volume":"18","author":"B Ma","year":"2002","journal-title":"Bioinformatics"},{"key":"ref16","doi-asserted-by":"crossref","unstructured":"Califano A, Rigoutsos I. FLASH: a fast look-up algorithm for string homology. In: Computer Vision and Pattern Recognition, 1993. Proceedings CVPR\u201993., 1993 IEEE Computer Society Conference on; 1993. p. 353\u2013359.","DOI":"10.1109\/CVPR.1993.341106"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"3584","DOI":"10.1093\/bioinformatics\/btv419","article-title":"Spaced seeds improve <italic>k<\/italic>-mer-based metagenomic classification","volume":"31","author":"K B\u0159inda","year":"2015","journal-title":"Bioinformatics"},{"key":"ref18","doi-asserted-by":"crossref","unstructured":"Ounit R, Lonardi S. Higher Classification Accuracy of Short Metagenomic Reads by Discriminative Spaced <italic>k<\/italic>-mers. In: Pop M, Touzet H, editors. Algorithms in Bioinformatics: 15th International Workshop, WABI 2015, Atlanta, GA, USA, September 10\u201312, 2015, Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg; 2015. p. 286\u2013295.","DOI":"10.1007\/978-3-662-48221-6_21"},{"key":"ref19","doi-asserted-by":"crossref","unstructured":"Onodera T, Shibuya T. The gapped spectrum kernel for support vector machines. In: Perner P, editor. Machine Learning and Data Mining in Pattern Recognition. vol. 7988 of Lecture Notes in Computer Science. Berlin,Heidelberg: Springer Berlin Heidelberg; 2013. p. 1\u201315.","DOI":"10.1007\/978-3-642-39712-7_1"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"e1000386+","DOI":"10.1371\/journal.pcbi.1000386","article-title":"SHRiMP: Accurate Mapping of Short Color-space Reads","volume":"5","author":"SM Rumble","year":"2009","journal-title":"PLOS Computational Biology"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2010\/708501","article-title":"Designing efficient spaced seeds for SOLiD read mapping","volume":"2010","author":"L No\u00e9","year":"2010","journal-title":"Advances in Bioinformatics"},{"key":"ref22","doi-asserted-by":"crossref","unstructured":"Darling AE, Treangen TJ, Zhang L, Kuiken C, Messeguer X, Perna NT. Procrastination Leads to Efficient Filtration for Local Multiple Alignment. In: B\u00fccher P, Moret BME, editors. Algorithms in Bioinformatics: 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11\u201313, 2006. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006. p. 126\u2013137.","DOI":"10.1007\/11851561_12"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"e11147+","DOI":"10.1371\/journal.pone.0011147","article-title":"progressiveMauve: Multiple Genome Alignment with Gene Gain, Loss and Rearrangement","volume":"5","author":"AE Darling","year":"2010","journal-title":"PLOS ONE"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"1991","DOI":"10.1093\/bioinformatics\/btu177","article-title":"Fast alignment-free sequence comparison using spaced-word frequencies","volume":"30","author":"CA Leimeister","year":"2014","journal-title":"Bioinformatics"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1089\/cmb.2006.13.336","article-title":"The average common substring approach to phylogenomic reconstruction","volume":"13","author":"I Ulitsky","year":"2006","journal-title":"Journal of Computational Biology"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1186\/1471-2105-6-123","article-title":"Genome comparison without alignment using shortest unique substrings","volume":"6","author":"B Haubold","year":"2005","journal-title":"BMC Bioinformatics"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"2000","DOI":"10.1093\/bioinformatics\/btu331","article-title":"<italic>kmacs<\/italic>: the <italic>k<\/italic>-mismatch average common substring approach to alignment-free sequence comparison","volume":"30","author":"CA Leimeister","year":"2014","journal-title":"Bioinformatics"},{"key":"ref28","doi-asserted-by":"crossref","unstructured":"Thankachan SV, Chockalingam SP, Liu Y, Krishnan A, Aluru S. A greedy alignment-free distance estimator for phylogenetic inference (extended abstract). In: Computational Advances in Bio and Medical Sciences (ICCABS), 2015 IEEE 5th International Conference on; 2015. p. 1\u20131.","DOI":"10.1109\/ICCABS.2015.7344711"},{"key":"ref29","article-title":"ALFRED: a practical method for alignment-free distance computation","author":"SV Thankachan","journal-title":"Journal of Computational Biology"},{"key":"ref30","article-title":"A Provably Efficient Algorithm for the <italic>k<\/italic>-Mismatch Average Common Substring Problem","author":"SV Thankachan","year":"2016","journal-title":"Journal of Computational Biology"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1142\/S0219720004000326","article-title":"Optimal spaced seeds for homologous coding regions","volume":"1","author":"B Brejova","year":"2004","journal-title":"Journal of Bioinformatics and Computational Biology"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.jcss.2004.12.008","article-title":"Vector seeds: an extension to spaced seeds","volume":"70","author":"B Brejova","year":"2005","journal-title":"Journal of Computer and System Sciences"},{"key":"ref33","doi-asserted-by":"crossref","unstructured":"Li M, Ma B, Zhang L. Superiority and complexity of the spaced seeds. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm. SODA\u201906. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics; 2006. p. 444\u2013453.","DOI":"10.1145\/1109557.1109607"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1186\/s13015-015-0032-x","article-title":"Estimating evolutionary distances between genomic sequences from spaced-word matches","volume":"10","author":"B Morgenstern","year":"2015","journal-title":"Algorithms for Molecular Biology"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"e59","DOI":"10.1093\/nar\/gku104","article-title":"Improved search heuristics find 20 000 new alignments between human and mouse genomes","volume":"42","author":"MC Frith","year":"2014","journal-title":"Nucleic Acids Research"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1038\/nmeth.3176","article-title":"Fast and sensitive protein alignment using DIAMOND","volume":"12","author":"B Buchfink","year":"2015","journal-title":"Nature Methods"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1089\/cmb.2014.0173","article-title":"A coverage criterion for spaced seeds and its applications to SVM string-kernels and <italic>k<\/italic>-mer distances","volume":"12","author":"L No\u00e9","year":"2014","journal-title":"Journal of Computational Biology"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1142\/S0219720004000661","article-title":"PatternHunter II: highly sensitive and fast homology search","volume":"02","author":"M Li","year":"2004","journal-title":"Journal of Bioinformatics and Computational Biology"},{"key":"ref39","doi-asserted-by":"crossref","first-page":"2969","DOI":"10.1093\/bioinformatics\/btm422","article-title":"Multiple spaced seeds for homology search","volume":"23","author":"L Ilie","year":"2007","journal-title":"Bioinformatics"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"2433","DOI":"10.1093\/bioinformatics\/btr368","article-title":"SpEED: fast computation of sensitive spaced seeds","volume":"27","author":"L Ilie","year":"2011","journal-title":"Bioinformatics"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"W7","DOI":"10.1093\/nar\/gku398","article-title":"<italic>Spaced words<\/italic> and <italic>kmacs<\/italic>: fast alignment-free sequence comparison based on inexact word matches","volume":"42","author":"S Horwege","year":"2014","journal-title":"Nucleic Acids Research"},{"key":"ref42","year":"2015","unstructured":"Hahn L, Leimeister CA, Morgenstern B.<italic>RasBhari<\/italic>: optimizing spaced seeds for database searching, read mapping and alignment-free sequence comparison. arXiv:151104001 [q-bioGN]. <year>2015<\/year>;."},{"key":"ref43","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1093\/bioinformatics\/btr046","article-title":"SHRiMP2: Sensitive yet Practical Short Read Mapping","volume":"27","author":"M David","year":"2011","journal-title":"Bioinformatics"},{"key":"ref44","doi-asserted-by":"crossref","first-page":"e7767+","DOI":"10.1371\/journal.pone.0007767","article-title":"BFAST: an alignment tool for large scale genome resequencing","volume":"4","author":"N Homer","year":"2009","journal-title":"PLOS ONE"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1142\/S0219720006001977","article-title":"A unifying framework for seed sensitivity and its application to subset seeds","volume":"4","author":"G Kucherov","year":"2006","journal-title":"Journal of Bioinformatics and Computational Biology"},{"key":"ref46","doi-asserted-by":"crossref","unstructured":"Duc DD, Dinh HQ, Dang TH, Laukens K, Xuan HH. AcoSeeD: An ant colony optimization for finding optimal spaced seeds in biological sequence search. In: ANTS\u201912; 2012. p. 204\u2013211.","DOI":"10.1007\/978-3-642-32650-9_19"},{"key":"ref47","doi-asserted-by":"crossref","unstructured":"Do PT, Tran-Thi CG. An improvement of the overlap complexity in the spaced seed searching problem between genomic DNAs. In: Proceedings of the 2nd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS); 2015. p. 271\u2013276.","DOI":"10.1109\/NICS.2015.7302205"},{"key":"ref48","article-title":"Higher classification sensitivity of short metagenomic reads with CLARK-S","author":"R Ounit","year":"2016","journal-title":"Bioinformatics"},{"key":"ref49","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1038\/nmeth.2066","article-title":"Metagenomic microbial community profiling using unique clade-specific marker genes","volume":"9","author":"N Segata","year":"2012","journal-title":"Nature Methods"},{"key":"ref50","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1038\/nmeth1043","article-title":"Use of simulated data sets to evaluate the fidelity of metagenomic processing methods","volume":"4","author":"K Mavromatis","year":"2007","journal-title":"Nature Methods"}],"container-title":["PLOS Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/dx.plos.org\/10.1371\/journal.pcbi.1005107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T11:27:41Z","timestamp":1589023661000},"score":1,"resource":{"primary":{"URL":"https:\/\/dx.plos.org\/10.1371\/journal.pcbi.1005107"}},"subtitle":[],"editor":[{"given":"Andreas","family":"Prlic","sequence":"first","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2016,10,19]]},"references-count":50,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2016,10,19]]}},"URL":"https:\/\/doi.org\/10.1371\/journal.pcbi.1005107","relation":{},"ISSN":["1553-7358"],"issn-type":[{"value":"1553-7358","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,19]]}}}