{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T18:54:08Z","timestamp":1726080848262},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030452568"},{"type":"electronic","value":"9783030452575"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45257-5_7","type":"book-chapter","created":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T12:05:35Z","timestamp":1587384335000},"page":"104-119","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["AStarix: Fast and Optimal Sequence-to-Graph Alignment"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-8119-3849","authenticated-orcid":false,"given":"Pesho","family":"Ivanov","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-3283-7908","authenticated-orcid":false,"given":"Benjamin","family":"Bichsel","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2125-6086","authenticated-orcid":false,"given":"Harun","family":"Mustafa","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-3411-0692","authenticated-orcid":false,"given":"Andr\u00e9","family":"Kahles","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-5486-8532","authenticated-orcid":false,"given":"Gunnar","family":"R\u00e4tsch","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0054-9568","authenticated-orcid":false,"given":"Martin","family":"Vechev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,21]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(92)90202-7","volume":"43","author":"L Allison","year":"1992","unstructured":"Allison, L.: Lazy dynamic-programming can be eager. Inf. Process. Lett. 43, 207\u2013212 (1992)","journal-title":"Inf. Process. Lett."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"SF Altschul","year":"1990","unstructured":"Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol. 215, 403\u2013410 (1990)","journal-title":"J. Mol. Biol."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1093\/bioinformatics\/btv688","volume":"32","author":"D Antipov","year":"2016","unstructured":"Antipov, D., Korobeynikov, A., McLean, J.S., Pevzner, P.A.: hybridSPAdes: an algorithm for hybrid assembly of short and long reads. Bioinformatics (Oxford, England) 32, 1009\u20131015 (2016)","journal-title":"Bioinformatics (Oxford, England)"},{"doi-asserted-by":"crossref","unstructured":"Brandt, D.Y.C., Aguiar, V.R.C., Bitarello, B.D., Nunes, K., Goudet, J., Meyer, D.: Mapping Bias Overestimates Reference Allele Frequencies at the HLA Genes in the 1000 Genomes Project Phase I Data. G3 (Bethesda, Md.) (2015)","key":"7_CR4","DOI":"10.1101\/013151"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"e14643","DOI":"10.1371\/journal.pone.0014643","volume":"6","author":"S Buhler","year":"2011","unstructured":"Buhler, S., Sanchez-Mazas, A.: HLA DNA sequence variation among human populations: molecular signatures of demographic and selective events. PLoS One 6, e14643 (2011)","journal-title":"PLoS One"},{"doi-asserted-by":"crossref","unstructured":"Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of A*. J. ACM (1985)","key":"7_CR6","DOI":"10.1145\/3828.3830"},{"issue":"6","key":"7_CR7","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1038\/ng.3257","volume":"47","author":"A Dilthey","year":"2015","unstructured":"Dilthey, A., Cox, C., Iqbal, Z., Nelson, M.R., McVean, G.: Improved genome inference in the MHC using a population reference graph. Nat. Genet. 47(6), 682 (2015)","journal-title":"Nat. Genet."},{"unstructured":"Dox, G., Fostier, J.: Efficient algorithms for pairwise sequence alignment on graphs. Master\u2019s thesis, Ghent University (2018)","key":"7_CR8"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1038\/nbt.4227","volume":"36","author":"E Garrison","year":"2018","unstructured":"Garrison, E., et al.: Variation graph toolkit improves read mapping by representing genetic variation in the reference. Nat. Biotechnol. 36, 875\u2013879 (2018)","journal-title":"Nat. Biotechnol."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"R124","DOI":"10.1186\/gb-2011-12-12-r124","volume":"12","author":"O Harismendy","year":"2011","unstructured":"Harismendy, O., et al.: Detection of low prevalence somatic mutations in solid tumors with ultra-deep targeted sequencing. Genome Biol. 12, R124 (2011)","journal-title":"Genome Biol."},{"doi-asserted-by":"crossref","unstructured":"Heydari, M., Miclotte, G., Van\u00a0de Peer, Y., Fostier, J.: BrownieAligner: accurate alignment of Illumina sequencing data to de Bruijn graphs. BMC Bioinformatics (2018)","key":"7_CR11","DOI":"10.1186\/s12859-018-2319-7"},{"unstructured":"Holtgrewe, M.: Mason - a read simulator for second generation sequencing data. Technical report FU Berlin (2010). \nhttp:\/\/publications.imp.fu-berlin.de\/962\/","key":"7_CR12"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"D689","DOI":"10.1093\/nar\/gkz890","volume":"48","author":"KL Howe","year":"2020","unstructured":"Howe, K.L., et al.: Ensembl Genomes 2020-enabling non-vertebrate genomic research. Nucleic Acids Res. 48, D689\u2013D695 (2020)","journal-title":"Nucleic Acids Res."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1093\/bioinformatics\/btr708","volume":"28","author":"W Huang","year":"2012","unstructured":"Huang, W., Li, L., Myers, J.R., Marth, G.T.: ART: a next-generation sequencing read simulator. Bioinformatics (Oxford, England) 28, 593\u2013594 (2012)","journal-title":"Bioinformatics (Oxford, England)"},{"doi-asserted-by":"crossref","unstructured":"Jain, C., Misra, S., Zhang, H., Dilthey, A., Aluru, S.: Accelerating sequence alignment to graphs. In: International Parallel and Distributed Processing Symposium (IPDPS) (2019). ISSN 1530\u20132075","key":"7_CR15","DOI":"10.1101\/651638"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-17083-7_6","volume-title":"Research in Computational Molecular Biology","author":"C Jain","year":"2019","unstructured":"Jain, C., Zhang, H., Gao, Y., Aluru, S.: On the complexity of sequence to graph alignment. In: Cowen, L.J. (ed.) RECOMB 2019. LNCS, vol. 11467, pp. 85\u2013100. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-17083-7_6"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/0471250953.bi1106s32","volume":"32","author":"G Jean","year":"2010","unstructured":"Jean, G., Kahles, A., Sreedharan, V.T., De Bona, F., R\u00e4tsch, G.: RNA-Seq read alignments with PALMapper. Curr. Protoc. Bioinformatics 32, 11\u201316 (2010)","journal-title":"Curr. Protoc. Bioinformatics"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1089\/cmb.2017.0264","volume":"26","author":"VNS Kavya","year":"2019","unstructured":"Kavya, V.N.S., Tayal, K., Srinivasan, R., Sivadasan, N.: Sequence alignment on directed graphs. J. Comput. Biol. 26, 53\u201367 (2019)","journal-title":"J. Comput. Biol."},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1038\/s41587-019-0201-4","volume":"37","author":"D Kim","year":"2019","unstructured":"Kim, D., Paggi, J.M., Park, C., Bennett, C., Salzberg, S.L.: Graph-based genome alignment and genotyping with HISAT2 and HISAT-genotype. Nat. Biotechnol. 37, 907\u2013915 (2019)","journal-title":"Nat. Biotechnol."},{"issue":"9","key":"7_CR20","doi-asserted-by":"publisher","first-page":"2520","DOI":"10.1093\/bioinformatics\/bts480","volume":"28","author":"J K\u00f6ster","year":"2012","unstructured":"K\u00f6ster, J., Rahmann, S.: Snakemake-a scalable bioinformatics workflow engine. Bioinformatics (Oxford, England) 28(9), 2520\u20132522 (2012)","journal-title":"Bioinformatics (Oxford, England)"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/nmeth.1923","volume":"9","author":"B Langmead","year":"2012","unstructured":"Langmead, B., Salzberg, S.L.: Fast gapped-read alignment with Bowtie 2. Nat. Methods 9, 357\u2013359 (2012)","journal-title":"Nat. Methods"},{"key":"7_CR22","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-Wheeler transform. Bioinformatics (Oxford, England) 25, 1754\u20131760 (2009)","journal-title":"Bioinformatics (Oxford, England)"},{"issue":"5","key":"7_CR23","doi-asserted-by":"publisher","first-page":"1374","DOI":"10.1093\/bioinformatics\/btz102","volume":"36","author":"A Limasset","year":"2019","unstructured":"Limasset, A., Flot, J.F., Peterlongo, P.: Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs. Bioinformatics 36(5), 1374\u20131381 (2019). btz102","journal-title":"Bioinformatics"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"3224","DOI":"10.1093\/bioinformatics\/btw371","volume":"32","author":"B Liu","year":"2016","unstructured":"Liu, B., Guo, H., Brudno, M., Wang, Y.: deBGA: read alignment with de Bruijn graph-based seed and extension. Bioinformatics (Oxford, England) 32, 3224\u20133232 (2016)","journal-title":"Bioinformatics (Oxford, England)"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1101\/gr.214155.116","volume":"27","author":"B Paten","year":"2017","unstructured":"Paten, B., Novak, A.M., Eizenga, J.M., Garrison, E.: Genome graphs and the evolution of genome inference. Genome Res. 27, 665\u2013676 (2017)","journal-title":"Genome Res."},{"key":"7_CR26","first-page":"23","volume":"4","author":"J Pearl","year":"1983","unstructured":"Pearl, J.: On the discovery and generation of certain heuristics. AI Mag. 4, 23 (1983)","journal-title":"AI Mag."},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"3599","DOI":"10.1093\/bioinformatics\/btz162","volume":"35","author":"M Rautiainen","year":"2019","unstructured":"Rautiainen, M., M\u00e4kinen, V., Marschall, T.: Bit-parallel sequence-to-graph alignment. Bioinformatics 35, 3599\u20133607 (2019)","journal-title":"Bioinformatics"},{"doi-asserted-by":"crossref","unstructured":"Rautiainen, M., Marschall, T.: Aligning sequences to general graphs in O(V+mE) time (2017, preprint)","key":"7_CR28","DOI":"10.1101\/216127"},{"key":"7_CR29","doi-asserted-by":"publisher","first-page":"3506","DOI":"10.1093\/bioinformatics\/btu538","volume":"30","author":"L Salmela","year":"2014","unstructured":"Salmela, L., Rivals, E.: LoRDEC: accurate and efficient long read error correction. Bioinformatics (Oxford, England) 30, 3506\u20133514 (2014)","journal-title":"Bioinformatics (Oxford, England)"},{"key":"7_CR30","doi-asserted-by":"publisher","first-page":"R98","DOI":"10.1186\/gb-2009-10-9-r98","volume":"10","author":"K Schneeberger","year":"2009","unstructured":"Schneeberger, K., et al.: Simultaneous alignment of short reads against multiple genomes. Genome Biol. 10, R98 (2009)","journal-title":"Genome Biol."},{"key":"7_CR31","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0097-3165(74)90050-8","volume":"16","author":"PH Sellers","year":"1974","unstructured":"Sellers, P.H.: An algorithm for the distance between two finite sequences. J. Comb. Theory 16, 253\u2013258 (1974)","journal-title":"J. Comb. Theory"},{"doi-asserted-by":"crossref","unstructured":"Sir\u00e9n, J.: Indexing variation graphs. In: 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (2017)","key":"7_CR32","DOI":"10.1137\/1.9781611974768.2"},{"key":"7_CR33","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1109\/TCBB.2013.2297101","volume":"11","author":"J Sir\u00e9n","year":"2014","unstructured":"Sir\u00e9n, J., V\u00e4lim\u00e4ki, N., M\u00e4kinen, V.: Indexing graphs for path queries with applications in genome research. IEEE\/ACM Trans. Comput. Biol. Bioinf. (TCBB) 11, 375\u2013388 (2014)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf. (TCBB)"},{"key":"7_CR34","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/0196-8858(81)90046-4","volume":"2","author":"TF Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: Comparison of biosequences. Adv. Appl. Math. 2, 482\u2013489 (1981)","journal-title":"Adv. Appl. Math."},{"key":"7_CR35","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1186\/1471-2164-14-536","volume":"14","author":"KR Stevenson","year":"2013","unstructured":"Stevenson, K.R., Coolon, J.D., Wittkopp, P.J.: Sources of bias in measures of allele-specific expression derived from RNA-seq data aligned to a single reference genome. BMC Genom. 14, 536 (2013)","journal-title":"BMC Genom."}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45257-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,3]],"date-time":"2020-05-03T19:04:54Z","timestamp":1588532694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45257-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452568","9783030452575"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45257-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"21 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Research in Computational Molecular Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.recomb2020.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}