{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T12:13:57Z","timestamp":1725884037408},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319569697"},{"type":"electronic","value":"9783319569703"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-56970-3_3","type":"book-chapter","created":{"date-parts":[[2017,4,11]],"date-time":"2017-04-11T00:43:49Z","timestamp":1491871429000},"page":"34-49","source":"Crossref","is-referenced-by-count":2,"title":["A Flow Procedure for the Linearization of Genome Sequence Graphs"],"prefix":"10.1007","author":[{"given":"David","family":"Haussler","sequence":"first","affiliation":[]},{"given":"Maciej","family":"Smuga-Otto","sequence":"additional","affiliation":[]},{"given":"Benedict","family":"Paten","sequence":"additional","affiliation":[]},{"given":"Adam M.","family":"Novak","sequence":"additional","affiliation":[]},{"given":"Sergei","family":"Nikitin","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Zueva","sequence":"additional","affiliation":[]},{"given":"Dmitrii","family":"Miagkov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,12]]},"reference":[{"key":"3_CR1","unstructured":"Paten, B., Novak, A., Haussler, D.: Mapping to a Reference Genome Structure eprint arXiv:1404.5010"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Paten, B., Novak, A.M., Garrison, E., Hickey, G.: Superbubbles, ultrabubbles and cacti. In: Proceedings of RECOMB 2017 (2017)","DOI":"10.1101\/101493"},{"key":"3_CR3","unstructured":"Baharev, A., Schichl, H., Neumaer, A., Achterberg, T.: An exact method for the minimum feedback arc set problem (2016)"},{"key":"3_CR4","series-title":"The IBM Research Symposia Series","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer US, New York (1972)"},{"key":"3_CR5","unstructured":"Brandenburg, F., Hanauer, K.: Sorting heuristics for the feedback arc set problem. Technical report. Number MIP-1104 (2011)"},{"key":"3_CR6","unstructured":"Gavril, F.: Some NP-complete problems on graphs. In: Proceedings of the 11th conference on Information Sciences and Systems, pp. 91\u201395 (1977)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.cor.2012.05.016","volume":"40","author":"R Mart\u00ed","year":"2013","unstructured":"Mart\u00ed, R., Pantrigo, J., Duarte, A., Pardo, E.: Branch and bound for the cutwidth minimization problem. Comput. Oper. Res. 40, 137\u2013149 (2013). doi: 10.1016\/j.cor.2012.05.016","journal-title":"Comput. Oper. Res."},{"key":"3_CR8","volume-title":"Introduction to algorithms","author":"T Cormen","year":"2009","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to algorithms. Mit Press, Cambridge (Inglaterra) (2009)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1089\/cmb.2009.0047","volume":"16","author":"P Medvedev","year":"2009","unstructured":"Medvedev, P., Brudno, M.: Maximum likelihood genome assembly. J. Comput. Biol. 16, 1101\u20131116 (2009). doi: 10.1089\/cmb.2009.0047","journal-title":"J. Comput. Biol."},{"key":"3_CR10","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"3_CR11","unstructured":"https:\/\/www.bioconductor.org\/packages\/release\/bioc\/html\/RSVSim.html"},{"key":"3_CR12","unstructured":"https:\/\/github.com\/vgteam\/vg"},{"key":"3_CR13","unstructured":"http:\/\/biorxiv.org\/content\/early\/2017\/01\/18\/101501"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/368996.369025","volume":"5","author":"A Kahn","year":"1962","unstructured":"Kahn, A.: Topological sorting of large networks. Commun. ACM 5, 558\u2013562 (1962). doi: 10.1145\/368996.369025","journal-title":"Commun. ACM"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0020-0190(93)90079-O","volume":"47","author":"P Eades","year":"1993","unstructured":"Eades, P., Lin, X., Smyth, W.: A fast and effective heuristic for the feedback arc set problem. Inf. Process. Lett. 47, 319\u2013323 (1993). doi: 10.1016\/0020-0190(93)90079-O","journal-title":"Inf. Process. Lett."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1089\/cmb.2014.0146","volume":"22","author":"N Nguyen","year":"2015","unstructured":"Nguyen, N., Hickey, G., Zerbino, D., Raney, B., Earl, D., Armstrong, J., Kent, W., Haussler, D., Paten, B.: Building a pan-genome reference for a population. J. Comput. Biol. 22, 387\u2013401 (2015). doi: 10.1089\/cmb.2014.0146","journal-title":"J. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56970-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T10:37:08Z","timestamp":1498387028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56970-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319569697","9783319569703"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56970-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}