{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T13:20:36Z","timestamp":1784812836428,"version":"3.55.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"S17","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1186\/1471-2105-16-s17-s3","type":"journal-article","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T01:59:14Z","timestamp":1449626354000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["How genome complexity can explain the difficulty of aligning reads to genomes"],"prefix":"10.1186","volume":"16","author":[{"given":"Vinhthuy","family":"Phan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shanshan","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quang","family":"Tran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nam S","family":"Vo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,12,7]]},"reference":[{"issue":"7","key":"7184_CR1","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1093\/bioinformatics\/btr046","volume":"27","author":"M David","year":"2011","unstructured":"David M, Dzamba M, Lister D, Ilie L, Brudno M: SHRiMP2: sensitive yet practical short read mapping. Bioinformatics. 2011, 27 (7): 1011-1012.","journal-title":"Bioinformatics"},{"issue":"10","key":"7184_CR2","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1038\/ng.437","volume":"41","author":"C Alkan","year":"2009","unstructured":"Alkan C, Kidd JM, Marques-Bonet T, Aksay G, Antonacci F, et al: Personalized copy number and segmental duplication maps using next-generation sequencing. Nat Genet. 2009, 41 (10): 1061-1067.","journal-title":"Nat Genet"},{"issue":"18","key":"7184_CR3","doi-asserted-by":"publisher","first-page":"2366","DOI":"10.1093\/bioinformatics\/bts450","volume":"28","author":"JC Mu","year":"2012","unstructured":"Mu JC, Jiang H, Kiani A, Mohiyuddin M, Asadi NB, Wong WH: Fast and accurate read alignment for resequencing. Bioinformatics. 2012, 28 (18): 2366-2373.","journal-title":"Bioinformatics"},{"issue":"20","key":"7184_CR4","doi-asserted-by":"publisher","first-page":"2534","DOI":"10.1093\/bioinformatics\/btq485","volume":"26","author":"G Rizk","year":"2010","unstructured":"Rizk G, Lavenier D: GASSST: global alignment short sequence search tool. Bioinformatics. 2010, 26 (20): 2534-2540.","journal-title":"Bioinformatics"},{"issue":"4","key":"7184_CR5","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-359.","journal-title":"Nat Methods"},{"issue":"5","key":"7184_CR6","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1093\/bioinformatics\/btp698","volume":"26","author":"H Li","year":"2010","unstructured":"Li H, Durbin R: Fast and accurate long-read alignment with burrows-wheeler transform. Bioinformatics. 2010, 26 (5): 589-595.","journal-title":"Bioinformatics"},{"issue":"5","key":"7184_CR7","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1093\/bioinformatics\/btn025","volume":"24","author":"R Li","year":"2008","unstructured":"Li R, Li Y, Kristiansen K, Wang J: SOAP: short oligonucleotide alignment program. Bioinformatics. 2008, 24 (5): 713-714.","journal-title":"Bioinformatics"},{"issue":"18","key":"7184_CR8","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1093\/bioinformatics\/bts414","volume":"28","author":"Y Liu","year":"2012","unstructured":"Liu Y, Schmidt B: Long read alignment based on maximal exact match seeds. Bioinformatics. 2012, 28 (18): 318-324.","journal-title":"Bioinformatics"},{"issue":"7","key":"7184_CR9","doi-asserted-by":"publisher","first-page":"e78","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): e78-","journal-title":"Nucleic Acids Res"},{"key":"7184_CR10","first-page":"313","volume":"1","author":"H Ponstingl","year":"2010","unstructured":"Ponstingl H, Ning Z: SMALT-a new mapper for DNA sequencing reads. F1000 Posters. 2010, 1: 313-","journal-title":"F1000 Posters"},{"issue":"1","key":"7184_CR11","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/1756-0381-5-6","volume":"5","author":"X Yu","year":"2012","unstructured":"Yu X, Guda K, Willis J, Veigl M, Wang Z, Markowitz MD, et al: How do alignment programs perform on sequencing data with varying qualities and from repetitive regions?. BioData Min. 2012, 5 (1): 6-","journal-title":"BioData Min"},{"key":"7184_CR12","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2012.03.007","volume":"438","author":"V Becher","year":"2012","unstructured":"Becher V, Heiber PA: A linearly computable measure of string complexity. Theoretical Computer Science. 2012, 438: 62-73.","journal-title":"Theoretical Computer Science"},{"issue":"10","key":"7184_CR13","doi-asserted-by":"publisher","first-page":"R108","DOI":"10.1186\/gb-2009-10-10-r108","volume":"10","author":"B Chor","year":"2009","unstructured":"Chor B, Horn D, Goldman N, Levy T, Massingham T: Genomic DNA k-mer spectra: models and modalities. Genome Biology. 2009, 10 (10): R108-","journal-title":"Genome Biology"},{"key":"7184_CR14","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1186\/1471-2164-9-517","volume":"9","author":"S Kurtz","year":"2008","unstructured":"Kurtz S, Narechania A, Stein JC, Ware D: A new method to compute k-mer frequencies and its application to annotate large repetitive plant genomes. BMC Genomics. 2008, 9: 517-","journal-title":"BMC Genomics"},{"issue":"4","key":"7184_CR15","doi-asserted-by":"crossref","first-page":"381","DOI":"10.25088\/ComplexSystems.17.4.381","volume":"17","author":"NE Whiteford","year":"2008","unstructured":"Whiteford NE, Haslam NJ, Weber G, Prugel-Bennett A, Essex JW, Neylon C, et al: Visualizing the repeat structure of genomic sequences. Complex Systems. 2008, 17 (4): 381-398.","journal-title":"Complex Systems"},{"issue":"6","key":"7184_CR16","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen J, Sanders P, Burkhardt S: Linear work suffix array construction. J ACM. 2006, 53 (6): 918-936.","journal-title":"J ACM"},{"key":"7184_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching Lecture Notes in Computer Science","author":"T Kasai","year":"2001","unstructured":"Kasai T, Lee G, Arimura H, Arikawa S, Park K: Linear-time longest-common-prefix computation in suffix arrays and its applications. Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching Lecture Notes in Computer Science. 2001, 181-192."},{"issue":"16","key":"7184_CR18","doi-asserted-by":"publisher","first-page":"2078","DOI":"10.1093\/bioinformatics\/btp352","volume":"25","author":"H Li","year":"2009","unstructured":"Li H, Handsaker B, Wysoker A, Fennell T, Ruan J, Homer N, et al: The sequence alignment\/map format and samtools. Bioinformatics. 2009, 25 (16): 2078-2079.","journal-title":"Bioinformatics"},{"key":"7184_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1186\/1748-7188-4-3","volume":"4","author":"P Peterlongo","year":"2009","unstructured":"Peterlongo P, Sacomoto GA, do Lago AP, Pisanti N, Sagot MF: Lossless filter for multiple repeats with bounded edit distance. Algorithms Mol Biol. 2009, 4: 3-","journal-title":"Algorithms Mol Biol"},{"issue":"5","key":"7184_CR20","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1093\/bib\/bbq015","volume":"11","author":"H Li","year":"2010","unstructured":"Li H, Homer N: A survey of sequence alignment algorithms for next-generation sequencing. Briefings in Bioinformatics. 2010, 11 (5): 473-483.","journal-title":"Briefings in Bioinformatics"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-16-S17-S3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T18:02:00Z","timestamp":1748714520000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-16-S17-S3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":20,"journal-issue":{"issue":"S17","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["7184"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-16-s17-s3","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12]]},"assertion":[{"value":"7 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"S3"}}