{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:28:23Z","timestamp":1773275303583,"version":"3.50.1"},"reference-count":7,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T00:00:00Z","timestamp":1548806400000},"content-version":"vor","delay-in-days":365,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1439057"],"award-info":[{"award-number":["1439057"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["1421908"],"award-info":[{"award-number":["1421908"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["1453527"],"award-info":[{"award-number":["1453527"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000153","name":"Division of Biological Infrastructure","doi-asserted-by":"publisher","award":["1356529"],"award-info":[{"award-number":["1356529"]}],"id":[{"id":"10.13039\/100000153","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7,19]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>As computer scientists working in bioinformatics\/computational biology, we often face the challenge of coming up with an algorithm to answer a biological question. This occurs in many areas, such as variant calling, alignment and assembly. In this tutorial, we use the example of the genome assembly problem to demonstrate how to go from a question in the biological realm to a solution in the computer science realm. We show the modeling process step-by-step, including all the intermediate failed attempts. Please note this is not an introduction to how genome assembly algorithms work and, if treated as such, would be incomplete and unnecessarily long-winded.<\/jats:p>","DOI":"10.1093\/bib\/bby003","type":"journal-article","created":{"date-parts":[[2018,1,9]],"date-time":"2018-01-09T20:38:36Z","timestamp":1515530316000},"page":"1376-1383","source":"Crossref","is-referenced-by-count":16,"title":["Modeling biological problems in computer science: a case study in genome assembly"],"prefix":"10.1093","volume":"20","author":[{"given":"Paul","family":"Medvedev","sequence":"first","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2018,1,30]]},"reference":[{"issue":"12","key":"2020030521243766700_bby003-B1","doi-asserted-by":"crossref","first-page":"e1003345","DOI":"10.1371\/journal.pcbi.1003345","article-title":"Next-generation sequence assembly: four stages of data processing and computational challenges","volume":"9","author":"El-Metwally","year":"2013","journal-title":"PLoS Comput Biol"},{"issue":"6","key":"2020030521243766700_bby003-B2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ygeno.2010.03.001","article-title":"Assembly algorithms for next-generation sequencing data","volume":"95","author":"Miller","year":"2010","journal-title":"Genomics"},{"issue":"3","key":"2020030521243766700_bby003-B3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1038\/nrg3367","article-title":"Sequence assembly demystified","volume":"14","author":"Nagarajan","year":"2013","journal-title":"Nat Rev Genet"},{"issue":"9","key":"2020030521243766700_bby003-B4","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1101\/gr.101360.109","article-title":"Assembly of large genomes using second-generation sequencing","volume":"20","author":"Schatz","year":"2010","journal-title":"Genome Res"},{"key":"2020030521243766700_bby003-B5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1146\/annurev-genom-090314-050032","article-title":"The theory and practice of genome sequence assembly","volume":"16","author":"Simpson","year":"2015","journal-title":"Annu Rev Genomics Hum Genet"},{"key":"2020030521243766700_bby003-B6","doi-asserted-by":"crossref","DOI":"10.1093\/bib\/bbw096","article-title":"The present and future of de novo whole-genome assembly","author":"Sohn","year":"2016","journal-title":"Brief Bioinform"},{"issue":"2","key":"2020030521243766700_bby003-B7","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.gpb.2012.05.006","article-title":"Review of general algorithmic features for genome assemblers for next generation sequencers","volume":"10","author":"Wajid","year":"2012","journal-title":"Genomics Proteomics Bioinformatics"}],"container-title":["Briefings in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/bib\/article-pdf\/20\/4\/1376\/30119444\/bby003.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/bib\/article-pdf\/20\/4\/1376\/30119444\/bby003.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T02:26:50Z","timestamp":1583461610000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bib\/article\/20\/4\/1376\/4830907"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,30]]},"references-count":7,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,1,30]]},"published-print":{"date-parts":[[2019,7,19]]}},"URL":"https:\/\/doi.org\/10.1093\/bib\/bby003","relation":{},"ISSN":["1467-5463","1477-4054"],"issn-type":[{"value":"1467-5463","type":"print"},{"value":"1477-4054","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2019,7]]},"published":{"date-parts":[[2018,1,30]]}}}