{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T18:06:25Z","timestamp":1692295585009},"reference-count":19,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2015edp7433","type":"journal-article","created":{"date-parts":[[2017,1,31]],"date-time":"2017-01-31T17:30:02Z","timestamp":1485883802000},"page":"256-264","source":"Crossref","is-referenced-by-count":2,"title":["FPGA Hardware Acceleration of a Phylogenetic Tree Reconstruction with Maximum Parsimony Algorithm"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Henry","family":"BLOCK","sequence":"first","affiliation":[{"name":"Faculty of Engineering, Information and Systems, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsutomu","family":"MARUYAMA","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, Information and Systems, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] E.O. Wiley and B.S. Lieberman, Phylogenetics: Theory and Practice of Phylogenetic Systematics, 2nd ed., Wiley-Blackwell, 2011.","DOI":"10.1002\/9781118017883"},{"key":"2","unstructured":"[2] N.H. Barton, D.E.G. Briggs, J.A. Eisen, D.B. Goldstein, and N.H. Patel, Evolution, 1st ed., Cold Spring Harbor Laboratory Press, 2007."},{"key":"3","unstructured":"[3] Flytree, http:\/\/wwx.inhs.illinois.edu\/research\/flytree\/flyphylogeny\/, last access on October, 2015."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] D.M. Hillis, C. Moritz, and B.K. Mable, Molecular Systematics, 2nd ed., Sinauer Associates, 1996.","DOI":"10.2307\/1447682"},{"key":"5","unstructured":"[5] A.W.F. Edwards and L.L. Cavalli-Sforza, \u201cThe reconstruction of evolution,\u201d Annals of Human Genetics, vol.27, pp.105-106, 1963."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] L.R. Founds and R.L. Graham, \u201cThe Steiner problem in phylogeny is NP-complete,\u201d Advances in Applied Mathematics, vol.3, no.1, pp.43-49, 1982.","DOI":"10.1016\/S0196-8858(82)80004-3"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] A. Goffon, J.-M. Richer, and J.-K. Hao, \u201cProgressive tree neighborhood applied to the maximum parsimony problem,\u201d IEEE\/ACM Trans. Comput. Biol. Bioinf., vol.5, no.1, pp.136-145, 2008.","DOI":"10.1109\/TCBB.2007.1065"},{"key":"8","unstructured":"[8] S. Kasap and K. Benkrid, \u201cHigh performance phylogenetic analysis with maximum parsimony on reconfigurable hardware,\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol.99, pp.1-13, 2010."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] N. Alachiotis and A. Stamatakis, \u201cFPGA acceleration of the phylogenetic parsimony kernel?,\u201d Proc. 21st International Conference on Field Programable Logic (FPL), pp.417-422, 2011.","DOI":"10.1109\/FPL.2011.83"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] H. Block and T. Maruyama, \u201cA hardware acceleration of a phylogenetic tree reconstruction with maximum parsimony algorithm using FPGA,\u201d International Conference on Field-Programmable Technology (FPT), pp.318-321, 2013.","DOI":"10.1109\/FPT.2013.6718376"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] H. Block and T. Maruyama, \u201cAn FPGA hardware acceleration of the indirect calculation of tree lengths method for phylogenetic tree reconstruction,\u201d International Conference on Field Programmable Logic and Applications (FPL), pp.1-4, 2014.","DOI":"10.1109\/FPL.2014.6927430"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] P.A. Goloboff, J.S. Farris, and K.C. Nixon, \u201cTNT, a free program for phylogenetic analysis,\u201d Cladistics, The International Journal of the Willi Hennig Society, vol.24, no.5, pp.774-786, 2008.","DOI":"10.1111\/j.1096-0031.2008.00217.x"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] S. Che, J. Li, J.W. Sheaffer, K. Skadron, and J. Lach, \u201cAccelerating compute-intensive applications with GPUs and FPGAs,\u201d Application Specific Processors, SASP, pp.101-107, 2008.","DOI":"10.1109\/SASP.2008.4570793"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] P. Goloboff, \u201cMethods for faster parsimony analysis,\u201d Cladistics, vol.12, no.3, pp.199-220, 1996.","DOI":"10.1111\/j.1096-0031.1996.tb00009.x"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] W.M. Fitch, \u201cTowards defining course of evolution: minimum change for a specified tree topology,\u201d Systematic Zoology, vol.20, no.4, pp.406-416, 1971.","DOI":"10.2307\/2412116"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] D. Sankoff and P. Rousseau, \u201cLocating the vertices of a Steiner tree in an arbitrary metric space,\u201d Mathematical Programming, vol.9, no.1, pp.240-246, 1975.","DOI":"10.1007\/BF01681346"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] F. Ronquist, \u201cFast fitch-parsimony algorithms for large data sets,\u201d Cladistics, vol.14, no.4, pp.387-400, 1998.","DOI":"10.1111\/j.1096-0031.1998.tb00346.x"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] J.-M. Richer, A. Go\u00ebffon, and J.-K. Hao, \u201cA memetic algorithm for phylogenetic reconstruction with maximum parsimony,\u201d Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics, Lecture Notes in Computer Science, vol.5483, pp.164-175, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009.","DOI":"10.1007\/978-3-642-01184-9_15"},{"key":"19","unstructured":"[19] TreeBASE: A database of phylogenetic knowledge: http:\/\/www.treebase.org\/ (last access on October, 2015)."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/2\/E100.D_2015EDP7433\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T00:26:20Z","timestamp":1568766380000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/2\/E100.D_2015EDP7433\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015edp7433","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}