{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:02:30Z","timestamp":1773270150264,"version":"3.50.1"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031047480","type":"print"},{"value":"9783031047497","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-04749-7_14","type":"book-chapter","created":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T16:13:24Z","timestamp":1652285604000},"page":"230-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Fast, Flexible, and\u00a0Exact Minimum Flow Decompositions via\u00a0ILP"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6398-919X","authenticated-orcid":false,"given":"Fernando H. C.","family":"Dias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3785-0247","authenticated-orcid":false,"given":"Lucia","family":"Williams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7151-2124","authenticated-orcid":false,"given":"Brendan","family":"Mumey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5747-8350","authenticated-orcid":false,"given":"Alexandru I.","family":"Tomescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,29]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA594171","volume-title":"Network Flows","author":"RK Ahuja","year":"1988","unstructured":"Ahuja, R.K., et al.: Network Flows. Alfred P. Sloan School of Management, Cambridge (1988)"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13059-020-1935-5","volume":"21","author":"SL Amarasinghe","year":"2020","unstructured":"Amarasinghe, S.L., et al.: Opportunities and challenges in long-read sequencing data analysis. Genome Biol. 21(1), 1\u201316 (2020)","journal-title":"Genome Biol."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-030-45257-5_14","volume-title":"Research in Computational Molecular Biology","author":"JA Baaijens","year":"2020","unstructured":"Baaijens, J.A., Stougie, L., Sch\u00f6nhuth, A.: Strain-aware assembly of genomes from\u00a0mixed samples using flow variation\u00a0graphs. In: Schwartz, R. (ed.) RECOMB 2020. LNCS, vol. 12074, pp. 221\u2013222. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45257-5_14"},{"issue":"17","key":"14_CR4","doi-asserted-by":"publisher","first-page":"2447","DOI":"10.1093\/bioinformatics\/btu317","volume":"30","author":"E Bernard","year":"2014","unstructured":"Bernard, E., et al.: Efficient RNA isoform identification and quantification from RNA-Seq data with network flows. Bioinformatics 30(17), 2447\u20132455 (2014)","journal-title":"Bioinformatics"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.trb.2006.02.002","volume":"41","author":"B Bixby","year":"2007","unstructured":"Bixby, B.: The Gurobi optimizer. Transp. Res. Part B 41(2), 159\u2013178 (2007)","journal-title":"Transp. Res. Part B"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13059-015-0865-0","volume":"17","author":"S Canzar","year":"2016","unstructured":"Canzar, S., et al.: CIDANE: comprehensive isoform discovery and abundance estimation. Genome Biol. 17(1), 1\u201318 (2016)","journal-title":"Genome Biol."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, R., et al.: On the effect of forwarding table size on SDN network utilization. In: IEEE INFOCOM 2014-IEEE conference on computer communications, pp. 1734\u20131742. IEEE (2014)","DOI":"10.1109\/INFOCOM.2014.6848111"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Dias, F.H.C.: Fast, Flexible, and Exact Minimum Flow Decompositions via ILP. arXiv arXiv:2201.10923 (2022)","DOI":"10.1007\/978-3-031-04749-7_14"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10479-018-3118-2","volume":"279","author":"F Furini","year":"2019","unstructured":"Furini, F., Traversi, E.: Theoretical and computational study of several linearisation techniques for binary quadratic problems. Ann. Oper. Res. 279(1), 387\u2013411 (2019). https:\/\/doi.org\/10.1007\/s10479-018-3118-2","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-019-2786-5","volume":"20","author":"T Gatter","year":"2019","unstructured":"Gatter, T., Stadler, P.F.: Ry\u016bt\u014d: network-flow based transcriptome reconstruction. BMC Bioinf. 20(1), 1\u201314 (2019). https:\/\/doi.org\/10.1186\/s12859-019-2786-5","journal-title":"BMC Bioinf."},{"key":"14_CR11","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2021). https:\/\/www.gurobi.com"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Integer Linear Programming in Computational and Systems Biology: An Entry-Level Text and Course. Cambridge University Press, New York (2019)","DOI":"10.1017\/9781108377737"},{"issue":"6","key":"14_CR13","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1038\/s41587-020-0497-0","volume":"38","author":"M Hagemann-Jensen","year":"2020","unstructured":"Hagemann-Jensen, M., et al.: Single-cell RNA counting at allele and isoform resolution using Smart-seq3. Nat. Biotechnol. 38(6), 708\u2013714 (2020)","journal-title":"Nat. Biotechnol."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Hartman, T., et al.: How to split a flow? In: 2012 Proceedings IEEE INFOCOM, pp. 828\u2013836. IEEE (2012)","DOI":"10.1109\/INFCOM.2012.6195830"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Hong, C.Y., et al.: Achieving high utilization with software-driven wan. In: Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM, pp. 15\u201326 (2013)","DOI":"10.1145\/2486001.2486012"},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13059-021-02261-x","volume":"22","author":"KK Huang","year":"2021","unstructured":"Huang, K.K., et al.: Long-read transcriptome sequencing reveals abundant promoter diversity in distinct molecular subtypes of gastric cancer. Genome Biol. 22(1), 1\u201324 (2021). https:\/\/doi.org\/10.1186\/s13059-021-02261-x","journal-title":"Genome Biol."},{"key":"14_CR17","unstructured":"IBM ILOG CPLEX Optimization Studio: CPLEX Users Manual, ver. 12.7 (2017)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Khan, S., et al.: Safety and Completeness in Flow Decompositions for RNA Assembly. arXiv arXiv:2201.10372 (2022)","DOI":"10.1007\/978-3-031-04749-7_11"},{"issue":"8","key":"14_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., et al.: Graph-based genome alignment and genotyping with HISAT2 and HISAT-genotype. Nat. Biotechnol. 37(8), 907\u2013915 (2019)","journal-title":"Nat. Biotechnol."},{"issue":"12","key":"14_CR20","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1101\/gr.081422.108","volume":"18","author":"PM Kim","year":"2008","unstructured":"Kim, P.M., et al.: Analysis of copy number variants and segmental duplications in the human genome: Evidence for a change in the process of formation in recent evolutionary history. Genome Res. 18(12), 1865\u20131874 (2008)","journal-title":"Genome Res."},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Kloster, K., et al.: A practical FPT algorithm for flow decomposition and transcript assembly. In: 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 75\u201386. SIAM (2018)","DOI":"10.1137\/1.9781611975055.7"},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13059-019-1910-1","volume":"20","author":"S Kovaka","year":"2019","unstructured":"Kovaka, S., et al.: Transcriptome assembly from long-read RNA-seq alignments with StringTie2. Genome Biol. 20(1), 1\u201313 (2019). https:\/\/doi.org\/10.1186\/s13059-019-1910-1","journal-title":"Genome Biol."},{"key":"14_CR23","unstructured":"Li, W.: RNASeqReadSimulator: a simple RNA-seq read simulator (2014)"},{"issue":"11","key":"14_CR24","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1089\/cmb.2011.0171","volume":"18","author":"W Li","year":"2011","unstructured":"Li, W., et al.: IsoLasso: a LASSO regression approach to RNA-Seq based transcriptome assembly. J. Comput. Biol. 18(11), 1693\u20131707 (2011)","journal-title":"J. Comput. Biol."},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Liberti, L.: Compact linearization for binary quadratic problems. 4OR(3), 31\u2013245 (2007)","DOI":"10.1007\/s10288-006-0015-3"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-33122-0_14","volume-title":"Algorithms in Bioinformatics","author":"Y-Y Lin","year":"2012","unstructured":"Lin, Y.-Y., et al.: CLIIQ: accurate comparative detection and quantification of expressed isoforms in a population. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol. 7534, pp. 178\u2013189. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33122-0_14"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Ma, C., et al.: Finding ranges of optimal transcript expression quantification in cases of non-identifiability. bioRxiv (2020). https:\/\/doi.org\/10.1101\/2019.12.13.875625, to appear at RECOMB 2021","DOI":"10.1101\/2019.12.13.875625"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Mangul, S., et al.: An integer programming approach to novel transcript reconstruction from paired-end RNA-Seq reads. In: Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine, pp. 369\u2013376 (2012)","DOI":"10.1145\/2382936.2382983"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Mao, S., et al.: Refshannon: a genome-guided transcriptome assembler using sparse flow decomposition. PLoS One 15(6), e0232946 (2020)","DOI":"10.1371\/journal.pone.0232946"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Maretty, L., et al.: Bayesian transcriptome assembly. Genome Biol. 15(10), 1\u201311 (2014)","DOI":"10.1186\/s13059-014-0501-4"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Mumey, B., Shahmohammadi, S., McManus, K., Yaw, S.: Parity balancing path flow decomposition and routing. In: 2015 IEEE Globecom Workshops (GC Wkshps), pp. 1\u20136. IEEE (2015)","DOI":"10.1109\/GLOCOMW.2015.7414053"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Nagarajan, N., Pop, M.: Sequence assembly demystified. Nat. Rev. Genet. 14(3), 157\u2013167 (2013)","DOI":"10.1038\/nrg3367"},{"key":"14_CR33","unstructured":"Ohst, J.P.: On the Construction of Optimal Paths from Flows and the Analysis of Evacuation Scenarios. Ph.D. thesis, University of Koblenz and Landau, Germany (2015)"},{"key":"14_CR34","doi-asserted-by":"publisher","unstructured":"Olsen, N., et\u00a0al.: A study on flow decomposition methods for scheduling of electric buses in public transport based on aggregated time\u2013space network models. Cent. Eur. J. Oper. Res. (2020). https:\/\/doi.org\/10.1007\/s10100-020-00705-6","DOI":"10.1007\/s10100-020-00705-6"},{"key":"14_CR35","unstructured":"Patro, R., et al.: Salmon: accurate, versatile and ultrafast quantification from RNA-seq data using lightweight-alignment. BioRxiv, p. 021592 (2015)"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Pertea, M., et al.: StringTie enables improved reconstruction of a transcriptome from RNA-seq reads. Nat. Biotechnol. 33(3), 290\u2013295 (2015)","DOI":"10.1038\/nbt.3122"},{"issue":"5\u20136","key":"14_CR37","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/j.ygeno.2013.10.003","volume":"102","author":"Z Safikhani","year":"2013","unstructured":"Safikhani, Z., et al.: SSP: an interval integer linear programming for de novo transcriptome assembly and isoform discovery of RNA-seq reads. Genomics 102(5\u20136), 507\u2013514 (2013)","journal-title":"Genomics"},{"issue":"7403","key":"14_CR38","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1038\/nature10933","volume":"486","author":"SP Shah","year":"2012","unstructured":"Shah, S.P., et al.: The clonal and mutational evolution spectrum of primary triple-negative breast cancers. Nature 486(7403), 395\u2013399 (2012)","journal-title":"Nature"},{"issue":"12","key":"14_CR39","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1038\/nbt.4020","volume":"35","author":"M Shao","year":"2017","unstructured":"Shao, M., Kingsford, C.: Accurate assembly of transcripts through phase-preserving graph decomposition. Nat. Biotechnol. 35(12), 1167\u20131169 (2017)","journal-title":"Nat. Biotechnol."},{"issue":"2","key":"14_CR40","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1109\/TCBB.2017.2779509","volume":"16","author":"M Shao","year":"2017","unstructured":"Shao, M., Kingsford, C.: Theory and a heuristic for the minimum path flow decomposition problem. IEEE\/ACM Trans. Comput. Biol. Bioinf. 16(2), 658\u2013670 (2017)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"14_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.gene.2004.10.022","volume":"344","author":"S Stamm","year":"2005","unstructured":"Stamm, S., et al.: Function of alternative splicing. Gene 344, 1\u201320 (2005)","journal-title":"Gene"},{"issue":"1","key":"14_CR42","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.ejor.2016.01.003","volume":"252","author":"L Taccari","year":"2016","unstructured":"Taccari, L.: Integer programming formulations for the elementary shortest path problem. Eur. J. Oper. Res. 252(1), 122\u2013130 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR43","doi-asserted-by":"publisher","unstructured":"Tomescu, A.I., et al.: A novel min-cost flow method for estimating transcript expression with RNA-Seq. BMC Bioinf. 14, S1:51-S1:51 (2013). https:\/\/doi.org\/10.1186\/1471-2105-14-S5-S15","DOI":"10.1186\/1471-2105-14-S5-S15"},{"issue":"6","key":"14_CR44","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1109\/TCBB.2015.2418753","volume":"12","author":"AI Tomescu","year":"2015","unstructured":"Tomescu, A.I., et al.: Explaining a weighted DAG with few paths for solving genome-guided multi-assembly. IEEE\/ACM Trans. Comput. Biol. Bioinf. 12(6), 1345\u20131354 (2015)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"2","key":"14_CR45","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1089\/cmb.2012.0232","volume":"20","author":"A T\u00f6pfer","year":"2013","unstructured":"T\u00f6pfer, A., et al.: Probabilistic inference of viral quasispecies subject to recombination. J. Comput. Biol. 20(2), 113\u2013123 (2013)","journal-title":"J. Comput. Biol."},{"issue":"5","key":"14_CR46","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1038\/nbt.1621","volume":"28","author":"C Trapnell","year":"2010","unstructured":"Trapnell, C., et al.: Transcript assembly and quantification by RNA-Seq reveals unannotated transcripts and isoform switching during cell differentiation. Nature Biotechnol. 28(5), 511\u2013515 (2010)","journal-title":"Nature Biotechnol."},{"issue":"3","key":"14_CR47","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1016\/j.ejor.2006.05.043","volume":"185","author":"B Vatinlen","year":"2008","unstructured":"Vatinlen, B., et al.: Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths. Eur. J. Oper. Res. 185(3), 1390\u20131401 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"7074","key":"14_CR48","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1038\/nature04388","volume":"439","author":"M Vignuzzi","year":"2006","unstructured":"Vignuzzi, M., et al.: Quasispecies diversity determines pathogenesis through cooperative interactions in a viral population. Nature 439(7074), 344\u2013348 (2006)","journal-title":"Nature"},{"key":"14_CR49","doi-asserted-by":"crossref","unstructured":"Voshall, A., Moriyama, E.N.: Next-generation transcriptome assembly: strategies and performance analysis. In: Bioinformatics in the Era of Post Genomics and Big Data, pp. 15\u201336 (2018)","DOI":"10.5772\/intechopen.73497"},{"issue":"1","key":"14_CR50","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006). https:\/\/doi.org\/10.1007\/s10107-004-0559-y","journal-title":"Math. Program."},{"issue":"7221","key":"14_CR51","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1038\/nature07509","volume":"456","author":"ET Wang","year":"2008","unstructured":"Wang, E.T., et al.: Alternative isoform regulation in human tissue transcriptomes. Nature 456(7221), 470\u2013476 (2008)","journal-title":"Nature"},{"key":"14_CR52","doi-asserted-by":"publisher","unstructured":"Westbrooks, K., Astrovskaya, I., Campo, D., Khudyakov, Y., Berman, P., Zelikovsky, A.: HCV Quasispecies assembly using network flows. In: M\u0103ndoiu, I., Sunderraman, R., Zelikovsky, A. (eds.) ISBRA 2008. LNCS, vol. 4983, pp. 159\u2013170. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79450-9_15","DOI":"10.1007\/978-3-540-79450-9_15"},{"key":"14_CR53","doi-asserted-by":"crossref","unstructured":"Williams, L., et al.: RNA transcript assembly using inexact flows. In: 2019 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pp. 1907\u20131914. IEEE (2019)","DOI":"10.1109\/BIBM47256.2019.8983180"},{"key":"14_CR54","unstructured":"Williams, L., et al.: Flow decomposition with subpath constraints. In: 21st International Workshop on Algorithms in Bioinformatics (WABI 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"3","key":"14_CR55","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1101\/gr.1304504","volume":"14","author":"Y Xing","year":"2004","unstructured":"Xing, Y., et al.: The multiassembly problem: reconstructing multiple transcript isoforms from EST fragment mixtures. Genome Res. 14(3), 426\u2013441 (2004)","journal-title":"Genome Res."},{"issue":"1","key":"14_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-12-119","volume":"12","author":"O Zagordi","year":"2011","unstructured":"Zagordi, O., et al.: ShoRAH: estimating the genetic diversity of a mixed sample from next-generation sequencing data. BMC Bioinf. 12(1), 1\u20135 (2011). https:\/\/doi.org\/10.1186\/1471-2105-12-119","journal-title":"BMC Bioinf."},{"key":"14_CR57","doi-asserted-by":"publisher","unstructured":"Zhang, Q., et al.: Scallop2 enables accurate assembly of multiple-end RNA-seq data. bioRxiv (2021). https:\/\/doi.org\/10.1101\/2021.09.03.458862","DOI":"10.1101\/2021.09.03.458862"},{"key":"14_CR58","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2021.3083277","author":"J Zhao","year":"2021","unstructured":"Zhao, J., et al.: Multitrans: an algorithm for path extraction through mixed integer linear programming for transcriptome assembly. IEEE\/ACM Trans. Comput. Biol. Bioinf. (2021). https:\/\/doi.org\/10.1109\/TCBB.2021.3083277","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-04749-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T23:04:54Z","timestamp":1652310294000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-04749-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031047480","9783031047497"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-04749-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 April 2022","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":"San Diego, CA","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb2022.net\/","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":"188","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":"17","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":"23","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":"9% - 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.2","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":"6.5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}