{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:44:11Z","timestamp":1773272651659,"version":"3.50.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030170820","type":"print"},{"value":"9783030170837","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17083-7_6","type":"book-chapter","created":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T19:02:19Z","timestamp":1555268539000},"page":"85-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On the Complexity of Sequence to Graph Alignment"],"prefix":"10.1007","author":[{"given":"Chirag","family":"Jain","sequence":"first","affiliation":[]},{"given":"Haowen","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Srinivas","family":"Aluru","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,2]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1006\/jagm.1999.1063","volume":"35","author":"A Amir","year":"2000","unstructured":"Amir, A., Lewenstein, M., Lewenstein, N.: Pattern matching in hypertext. J. Algorithms 35(1), 82\u201399 (2000)","journal-title":"J. Algorithms"},{"issue":"7","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1093\/bioinformatics\/btv688","volume":"32","author":"D Antipov","year":"2015","unstructured":"Antipov, D., Korobeynikov, A., McLean, J.S., Pevzner, P.A.: hybridSPAdes: an algorithm for hybrid assembly of short and long reads. Bioinformatics 32(7), 1009\u20131015 (2015)","journal-title":"Bioinformatics"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Backurs, A., Indyk, P.: Edit distance cannot be computed in strongly subquadratic time (unless SETH is false). In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 51\u201358. ACM (2015)","DOI":"10.1145\/2746539.2746612"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-58163-7_3","volume-title":"Algorithms for Computational Biology","author":"S Beretta","year":"2017","unstructured":"Beretta, S., Bonizzoni, P., Denti, L., Previtali, M., Rizzi, R.: Mapping RNA-seq data to a transcript graph via approximate pattern matching to a hypertext. In: Figueiredo, D., Mart\u00edn-Vide, C., Pratas, D., Vega-Rodr\u00edguez, M.A. (eds.) AlCoB 2017. LNCS, vol. 10252, pp. 49\u201361. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-58163-7_3"},{"key":"6_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"issue":"6","key":"6_CR6","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."},{"issue":"11","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1038\/ng.3964","volume":"49","author":"HP Eggertsson","year":"2017","unstructured":"Eggertsson, H.P., et al.: Graphtyper enables population-scale genotyping using pangenome graphs. Nat. Genet. 49(11), 1654 (2017)","journal-title":"Nat. Genet."},{"issue":"13","key":"6_CR8","doi-asserted-by":"publisher","first-page":"i105","DOI":"10.1093\/bioinformatics\/bty279","volume":"34","author":"S Garg","year":"2018","unstructured":"Garg, S., Rautiainen, M., Novak, A.M., Garrison, E., Durbin, R., Marschall, T.: A graph-based approach to diploid genome assembly. Bioinformatics 34(13), i105\u2013i114 (2018)","journal-title":"Bioinformatics"},{"key":"6_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."},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O Gotoh","year":"1982","unstructured":"Gotoh, O.: An improved algorithm for matching biological sequences. J. Mol. Biol. 162(3), 705\u2013708 (1982)","journal-title":"J. Mol. Biol."},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1186\/s12859-018-2319-7","volume":"19","author":"M Heydari","year":"2018","unstructured":"Heydari, M., Miclotte, G., Van de Peer, Y., Fostier, J.: BrownieAligner: accurate alignment of illumina sequencing data to de Bruijn graphs. BMC Bioinform. 19(1), 311 (2018)","journal-title":"BMC Bioinform."},{"issue":"13","key":"6_CR12","doi-asserted-by":"publisher","first-page":"i361","DOI":"10.1093\/bioinformatics\/btt215","volume":"29","author":"L Huang","year":"2013","unstructured":"Huang, L., Popic, V., Batzoglou, S.: Short read alignment with populations of genomes. Bioinformatics 29(13), i361\u2013i370 (2013)","journal-title":"Bioinformatics"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-89929-9_7","volume-title":"Research in Computational Molecular Biology","author":"A Kuosmanen","year":"2018","unstructured":"Kuosmanen, A., Paavilainen, T., Gagie, T., Chikhi, R., Tomescu, A., M\u00e4kinen, V.: Using minimum path cover to boost dynamic programming on DAGs: co-linear chaining extended. In: Raphael, B.J. (ed.) RECOMB 2018. LNCS, vol. 10812, pp. 105\u2013121. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-89929-9_7"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1093\/bioinformatics\/18.3.452","volume":"18","author":"C Lee","year":"2002","unstructured":"Lee, C., Grasso, C., Sharlow, M.F.: Multiple sequence alignment using partial order graphs. Bioinformatics 18(3), 452\u2013464 (2002)","journal-title":"Bioinformatics"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1186\/s12859-016-1103-9","volume":"17","author":"A Limasset","year":"2016","unstructured":"Limasset, A., Cazaux, B., Rivals, E., Peterlongo, P.: Read mapping on de Bruijn graphs. BMC Bioinform. 17(1), 237 (2016)","journal-title":"BMC Bioinform."},{"issue":"21","key":"6_CR16","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 32(21), 3224\u20133232 (2016)","journal-title":"Bioinformatics"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Manber, U., Wu, S.: Approximate string matching with arbitrary costs for text and hypertext. In: Advances in Structural and Syntactic Pattern Recognition, pp. 22\u201333. World Scientific (1992)","DOI":"10.1142\/9789812797919_0002"},{"key":"6_CR18","unstructured":"Myers, E.W.: An overview of sequence comparison algorithms in molecular biology. University of Arizona, Department of Computer Science (1991)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Myers, E.W.: The fragment assembly string graph. Bioinformatics 21(Suppl\n                    \n                      \n                    \n                    $$\\_$$\n                    \n                      \n                        _\n                      \n                    \n                  2), ii79\u2013ii85 (2005)","DOI":"10.1093\/bioinformatics\/bti1114"},{"issue":"1\u20132","key":"6_CR20","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/S0304-3975(99)00333-3","volume":"237","author":"G Navarro","year":"2000","unstructured":"Navarro, G.: Improved approximate pattern matching on hypertext. Theoret. Comput. Sci. 237(1\u20132), 455\u2013463 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"6_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. (CSUR) 33(1), 31\u201388 (2001)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"5","key":"6_CR22","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1089\/cmb.2014.0146","volume":"22","author":"N Nguyen","year":"2015","unstructured":"Nguyen, N., et al.: Building a pan-genome reference for a population. J. Comput. Biol. 22(5), 387\u2013401 (2015)","journal-title":"J. Comput. Biol."},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Novak, A.M., et al.: Genome graphs. Preprint at bioRxiv (2017). \n                    https:\/\/doi.org\/10.1101\/101378","DOI":"10.1101\/101378"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-60044-2_51","volume-title":"Combinatorial Pattern Matching","author":"K Park","year":"1995","unstructured":"Park, K., Kim, D.K.: String matching in hypertext. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol. 937, pp. 318\u2013329. Springer, Heidelberg (1995). \n                    https:\/\/doi.org\/10.1007\/3-540-60044-2_51"},{"issue":"17","key":"6_CR25","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"PA Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An Eulerian path approach to DNA fragment assembly. Proc. Natl. Acad. Sci. 98(17), 9748\u20139753 (2001)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Rautiainen, M., Marschall, T.: Aligning sequences to general graphs in O(V + mE) time. Preprint at bioRxiv (2017). \n                    https:\/\/doi.org\/10.1101\/216127","DOI":"10.1101\/216127"},{"key":"6_CR27","first-page":"8","volume":"1","author":"WP Rowe","year":"2018","unstructured":"Rowe, W.P., Winn, M.D.: Indexed variation graphs for efficient and accurate resistome profiling. Bioinformatics 1, 8 (2018)","journal-title":"Bioinformatics"},{"issue":"24","key":"6_CR28","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 30(24), 3506\u20133514 (2014)","journal-title":"Bioinformatics"},{"issue":"2","key":"6_CR29","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. Bioinform. (TCBB) 11(2), 375\u2013388 (2014)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform. (TCBB)"},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.jda.2012.10.001","volume":"18","author":"C Thachuk","year":"2013","unstructured":"Thachuk, C.: Indexing hypertext. J. Discrete Algorithms 18, 113\u2013122 (2013)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"6_CR31","first-page":"53","volume":"26","author":"K Vaddadi","year":"2018","unstructured":"Vaddadi, K., Tayal, K., Srinivasan, R., Sivadasan, N.: Sequence alignment on directed graphs. J. Comput. Biol. 26(1), 53\u201367 (2018)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"6_CR32","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1186\/s12859-018-2051-3","volume":"19","author":"JR Wang","year":"2018","unstructured":"Wang, J.R., Holt, J., McMillan, L., Jones, C.D.: FMLRC: hybrid long read error correction using an FM-index. BMC Bioinform. 19(1), 50 (2018)","journal-title":"BMC Bioinform."},{"issue":"6","key":"6_CR33","doi-asserted-by":"publisher","first-page":"e1005595","DOI":"10.1371\/journal.pcbi.1005595","volume":"13","author":"RR Wick","year":"2017","unstructured":"Wick, R.R., Judd, L.M., Gorrie, C.L., Holt, K.E.: Unicycler: resolving bacterial genome assemblies from short and long sequencing reads. PLoS Comput. Biol. 13(6), e1005595 (2017)","journal-title":"PLoS Comput. Biol."},{"key":"6_CR34","doi-asserted-by":"publisher","unstructured":"Zhang, H., Jain, C., Aluru, S.: A comprehensive evaluation of long read error correction methods. Preprint at bioRxiv (2019). \n                    https:\/\/doi.org\/10.1101\/519330","DOI":"10.1101\/519330"}],"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-17083-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:15:20Z","timestamp":1558343720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17083-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030170820","9783030170837"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17083-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"2 April 2019","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":"Washington, DC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb2019.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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"175","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"20","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10% - 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"}},{"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"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}