{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T16:50:00Z","timestamp":1761238200230},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,6,11]],"date-time":"2015-06-11T00:00:00Z","timestamp":1433980800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1186\/s12859-015-0626-9","type":"journal-article","created":{"date-parts":[[2015,6,10]],"date-time":"2015-06-10T08:32:01Z","timestamp":1433925121000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["BitMapper: an efficient all-mapper based on bit-vector computing"],"prefix":"10.1186","volume":"16","author":[{"given":"Haoyu","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaipan","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaoyun","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Shang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,11]]},"reference":[{"key":"626_CR1","doi-asserted-by":"crossref","unstructured":"Langmead B, Trapnell C, Pop M, Salzberg SL. Ultrafast and memory-efficient alignment of short dna sequences to the human genome. Genome Biol. 2009; 10(3):25.","DOI":"10.1186\/gb-2009-10-3-r25"},{"issue":"4","key":"626_CR2","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/nmeth.1923","volume":"9","author":"B Langmead","year":"2012","unstructured":"Langmead B, Salzberg SL. Fast gapped-read alignment with bowtie 2. Nat Methods. 2012; 9(4):357\u20139.","journal-title":"Nat Methods"},{"issue":"14","key":"626_CR3","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","volume":"25","author":"H Li","year":"2009","unstructured":"Li H, Durbin R. Fast and accurate short read alignment with burrows\u2013wheeler transform. Bioinformatics. 2009; 25(14):1754\u201360.","journal-title":"Bioinformatics"},{"issue":"12","key":"626_CR4","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1038\/nmeth.2221","volume":"9","author":"S Marco-Sola","year":"2012","unstructured":"Marco-Sola S, Sammeth M, Guig\u00f3 R, Ribeca P. The gem mapper: fast, accurate and versatile alignment by filtration. Nat Methods. 2012; 9(12):1185\u20138.","journal-title":"Nat Methods"},{"issue":"20","key":"626_CR5","doi-asserted-by":"publisher","first-page":"2592","DOI":"10.1093\/bioinformatics\/bts505","volume":"28","author":"D Weese","year":"2012","unstructured":"Weese D, Holtgrewe M, Reinert K. Razers 3: faster, fully sensitive read mapping. Bioinformatics. 2012; 28(20):2592\u2013599.","journal-title":"Bioinformatics"},{"key":"626_CR6","doi-asserted-by":"crossref","unstructured":"Kim J, Li C, Xie X. Improving read mapping using additional prefix grams. BMC Bioinformatics. 2014; 15(1):42.","DOI":"10.1186\/1471-2105-15-42"},{"issue":"8","key":"626_CR7","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1038\/nmeth0810-576","volume":"7","author":"F Hach","year":"2010","unstructured":"Hach F, Hormozdiari F, Alkan C, Hormozdiari F, Birol I, Eichler EE, et al. mrsfast: a cache-oblivious algorithm for short-read mapping. Nat Methods. 2010; 7(8):576\u20137.","journal-title":"Nat Methods"},{"key":"626_CR8","doi-asserted-by":"crossref","unstructured":"Xin H, Lee D, Hormozdiari F, Yedkar S, Mutlu O, Alkan C. Accelerating read mapping with fasthash. BMC Genomics. 2013; 14(Suppl 1):13.","DOI":"10.1186\/1471-2164-14-S1-S13"},{"key":"626_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1093\/nar\/gkr1246","volume":"40","author":"A Ahmadi","year":"2012","unstructured":"Ahmadi A, Behm A, Honnalli N, Li C, Weng L, Xie X. Hobbes: optimized gram-based methods for efficient read alignment. Nucleic Acids Res. 2012; 40:41\u20131.","journal-title":"Nucleic Acids Res"},{"issue":"7","key":"626_CR10","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1093\/nar\/gkt005","volume":"41","author":"E Siragusa","year":"2013","unstructured":"Siragusa E, Weese D, Reinert K. Fast and accurate read mapping with approximate seeds and multiple backtracking. Nucleic Acids Res. 2013; 41(7):78\u20138.","journal-title":"Nucleic Acids Res"},{"issue":"3","key":"626_CR11","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46","author":"G Myers","year":"1999","unstructured":"Myers G. A fast bit-vector algorithm for approximate string matching based on dynamic programming. J ACM (JACM). 1999; 46(3):395\u2013415.","journal-title":"J ACM (JACM)"},{"issue":"1","key":"626_CR12","first-page":"29","volume":"10","author":"H Hyyr\u00f6","year":"2003","unstructured":"Hyyr\u00f6 H. A bit-vector algorithm for computing levenshtein and damerau edit distances. Nord J Comput. 2003; 10(1):29\u201339.","journal-title":"Nord J Comput"},{"key":"626_CR13","unstructured":"Siragusa WD E, Reinert K. Yara: well-defined alignment of high-throughput sequencing reads. http:\/\/www.seqan.de\/projects\/yara\/."},{"issue":"2","key":"626_CR14","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1089\/cmb.2006.13.296","volume":"13","author":"KR Rasmussen","year":"2006","unstructured":"Rasmussen KR, Stoye J, Myers EW. Efficient q-gram filters for finding all \u03b5-matches over a given length. J Comput Biol. 2006; 13(2):296\u2013308.","journal-title":"J Comput Biol"},{"issue":"9","key":"626_CR15","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1101\/gr.088823.108","volume":"19","author":"D Weese","year":"2009","unstructured":"Weese D, Emde AK, Rausch T, D\u00f6ring A, Reinert K. Razers-fast read mapping with sensitivity control. Genome Res. 2009; 19(9):1646\u201354.","journal-title":"Genome Res"},{"issue":"4","key":"626_CR16","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"PH Sellers","year":"1980","unstructured":"Sellers PH. The theory and computation of evolutionary distances: pattern recognition. J Algorithms. 1980; 1(4):359\u201373.","journal-title":"J Algorithms"},{"issue":"1","key":"626_CR17","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","volume":"6","author":"E Ukkonen","year":"1985","unstructured":"Ukkonen E. Finding approximate patterns in strings. J Algorithms. 1985; 6(1):132\u20137.","journal-title":"J Algorithms"},{"key":"626_CR18","unstructured":"Holtgrewe M. Mason\u2013a read simulator for second generation sequencing data. Technical Report FU Berlin. 2010."},{"key":"626_CR19","unstructured":"1000 Genomes: a Deep Catalog of Human Genetic Variation. http:\/\/www.1000genomes.org\/data."},{"key":"626_CR20","unstructured":"DNA Data Bank of Japan. ftp:\/\/ftp.ddbj.nig.ac.jp."},{"key":"626_CR21","unstructured":"National Center for Biotechnology Information. http:\/\/www.ncbi.nlm.nih.gov\/."},{"key":"626_CR22","doi-asserted-by":"crossref","unstructured":"Holtgrewe M, Emde AK, Weese D, Reinert K. A novel and well-defined benchmarking method for second generation read mapping. BMC Bioinformatics. 2011; 12(1):210.","DOI":"10.1186\/1471-2105-12-210"},{"key":"626_CR23","unstructured":"BaseSpace Sequencing Data Sets. http:\/\/www.illumina.com\/informatics\/research\/sequencing-data-analysis-management\/sequencing-data-library.html."}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12859-015-0626-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-015-0626-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-015-0626-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-015-0626-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,2]],"date-time":"2021-09-02T14:52:11Z","timestamp":1630594331000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-015-0626-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,11]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["626"],"URL":"https:\/\/doi.org\/10.1186\/s12859-015-0626-9","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,11]]},"assertion":[{"value":"26 November 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"192"}}