{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:23:05Z","timestamp":1740136985509,"version":"3.37.3"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001691","name":"JSPS KAKENHI","doi-asserted-by":"publisher","award":["17J06897","24240044","15K16081","17H01814"],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003382","name":"JST CREST","doi-asserted-by":"publisher","award":["JPMJCR1303"],"id":[{"id":"10.13039\/501100003382","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"JST Research Complex Program","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001700","name":"MEXT Program for Building Regional Innovation Ecosystems","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009619","name":"AMED Platform Project for Supporting Drug Discovery and Life Science Research","doi-asserted-by":"publisher","award":["JP17am0101112"],"id":[{"id":"10.13039\/100009619","id-type":"DOI","asserted-by":"publisher"}]},{"name":"AIST-Tokyo Tech Real World Big-Data Computation Open Innovation Laboratory"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Biology and Chemistry"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1016\/j.compbiolchem.2018.03.013","type":"journal-article","created":{"date-parts":[[2018,3,17]],"date-time":"2018-03-17T01:13:51Z","timestamp":1521249231000},"page":"399-406","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Optimization of memory use of fragment extension-based protein\u2013ligand docking with an original fast minimum cost flow algorithm"],"prefix":"10.1016","volume":"74","author":[{"given":"Keisuke","family":"Yanagisawa","sequence":"first","affiliation":[]},{"given":"Shunta","family":"Komine","sequence":"additional","affiliation":[]},{"given":"Rikuto","family":"Kubota","sequence":"additional","affiliation":[]},{"given":"Masahito","family":"Ohue","sequence":"additional","affiliation":[]},{"given":"Yutaka","family":"Akiyama","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0005","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1561\/0400000024","article-title":"The design of competitive online algorithms via a primal dual approach","volume":"3","author":"Buchbinder","year":"2009","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0010","series-title":"Interim Tech. Rep.","article-title":"A procedure for determining a family of minimum-cost network flow patterns","author":"Busacker","year":"1960"},{"year":"1963","series-title":"Linear Programming and Extensions","author":"Dantzig","key":"10.1016\/j.compbiolchem.2018.03.013_bib0015"},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0020","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.entcs.2011.06.003","article-title":"LEMON \u2013 an open source C++ graph template library","volume":"264","author":"Dezso","year":"2011","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0025","doi-asserted-by":"crossref","first-page":"1739","DOI":"10.1021\/jm0306430","article-title":"Glide: a new approach for rapid, accurate docking and scoring. 1. Method and assessment of docking accuracy","volume":"47","author":"Friesner","year":"2004","journal-title":"J. Med. Chem."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0030","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1137\/0218069","article-title":"Faster scaling algorithms for network","volume":"18","author":"Gabow","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0035","first-page":"27","article-title":"A new method for solving transportation-network problems","volume":"3","author":"Iri","year":"1960","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0040","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1021\/ci3001277","article-title":"ZINC: a free tool to discover chemistry for biology","volume":"52","author":"Irwin","year":"2012","journal-title":"J. Chem. Inf. Model."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0045","series-title":"Interim Tech. Rep.","article-title":"Optimal flow through networks","author":"Jewell","year":"1958"},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0050","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1287\/opre.10.4.476","article-title":"Optimal flow through networks with gains","volume":"10","author":"Jewell","year":"1962","journal-title":"Oper. Res."},{"year":"1991","series-title":"The minimum cost flow problem and the Network-Simplex method, Master's thesis","author":"Kelly","key":"10.1016\/j.compbiolchem.2018.03.013_bib0055"},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0060","first-page":"67","article-title":"Efficient implementations of minimum-cost flow algorithms","volume":"4","author":"Kiraly","year":"2012","journal-title":"Acta Univ. Sapient. Inf."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0065","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1021\/jm030363k","article-title":"Finding more needles in the haystack: a simple and efficient method for improving high-throughput docking results","volume":"47","author":"Klon","year":"2004","journal-title":"J. Med. Chem."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0070","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1080\/10556788.2014.895828","article-title":"Minimum-cost flow algorithms: an experimental evaluation","volume":"30","author":"Kovacs","year":"2015","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0075","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-642-38016-7_13","article-title":"Minimizing cache usage in paging","volume":"7846","author":"Lopez-Ortiz","year":"2013","journal-title":"Proc. of WAOA2012, Lect. Notes Comput. Sci."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0080","doi-asserted-by":"crossref","first-page":"146","DOI":"10.2174\/157340911795677602","article-title":"Molecular docking: a powerful approach for structure-based drug discovery","volume":"7","author":"Meng","year":"2011","journal-title":"Curr. Comput. Aided Drug Des."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0085","doi-asserted-by":"crossref","first-page":"2785","DOI":"10.1002\/jcc.21256","article-title":"AutoDock4 and AutoDockTools4: automated docking with selective receptor flexibility","volume":"30","author":"Morris","year":"2009","journal-title":"J. Comput. Chem."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0090","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02614365","article-title":"A polynomical time primal Network-Simplex algorithm for minimum cost flows","volume":"78","author":"Orlin","year":"1997","journal-title":"Math. Program."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0095","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1109\/CVPR.2011.5995604","article-title":"Globally-optimal greedy algorithms for tracking a variable number of objects","author":"Pirsiavash","year":"2011","journal-title":"Proc. of 2011 IEEE Conf. CVPR"},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0100","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1002\/jcc.21643","article-title":"Can we trust docking results? Evaluation of seven commonly used programs on PDBbind database","volume":"32","author":"Plewczynski","year":"2011","journal-title":"J. Comput. Chem."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0105","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1006\/jmbi.1996.0477","article-title":"A fast flexible docking method using an incremental construction algorithm","volume":"261","author":"Rarey","year":"1996","journal-title":"J. Mol. Biol."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0110","doi-asserted-by":"crossref","first-page":"D345","DOI":"10.1093\/nar\/gku1214","article-title":"The RCSB Protein Data Bank: views of structural biology for basic and applied research and education","volume":"43","author":"Rose","year":"2015","journal-title":"Nucleic Acids Res."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0115","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1124\/pr.112.007336","article-title":"Computational methods in drug discovery","volume":"66","author":"Sliwoski","year":"2014","journal-title":"Pharmacol. Rev."},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0120","doi-asserted-by":"crossref","first-page":"3836","DOI":"10.1093\/bioinformatics\/btx178","article-title":"Spresso: an ultrafast compound pre-screening method based on compound decomposition","volume":"33","author":"Yanagisawa","year":"2017","journal-title":"Bioinformatics"},{"key":"10.1016\/j.compbiolchem.2018.03.013_bib0125","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.jmgm.2006.06.002","article-title":"eHiTS: a new fast, exhaustive flexible ligand docking system","volume":"26","author":"Zsoldos","year":"2007","journal-title":"J. Mol. Graph. Model."}],"container-title":["Computational Biology and Chemistry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1476927118301348?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1476927118301348?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T03:34:13Z","timestamp":1615433653000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1476927118301348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":25,"alternative-id":["S1476927118301348"],"URL":"https:\/\/doi.org\/10.1016\/j.compbiolchem.2018.03.013","relation":{},"ISSN":["1476-9271"],"issn-type":[{"type":"print","value":"1476-9271"}],"subject":[],"published":{"date-parts":[[2018,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimization of memory use of fragment extension-based protein\u2013ligand docking with an original fast minimum cost flow algorithm","name":"articletitle","label":"Article Title"},{"value":"Computational Biology and Chemistry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.compbiolchem.2018.03.013","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}