{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:46:14Z","timestamp":1730198774468,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1109\/asap.2010.5540797","type":"proceedings-article","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T11:51:40Z","timestamp":1281441100000},"page":"89-96","source":"Crossref","is-referenced-by-count":2,"title":["An optimized NoC architecture for accelerating TSP kernels in breakpoint median problem"],"prefix":"10.1109","author":[{"given":"Turbo","family":"Majumder","sequence":"first","affiliation":[]},{"given":"Souradip","family":"Sarkar","sequence":"additional","affiliation":[]},{"given":"Partha","family":"Pande","sequence":"additional","affiliation":[]},{"given":"Ananth","family":"Kalyanaraman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"25","article-title":"Breakpoint phylogenies","author":"blanchette","year":"1997","journal-title":"Genome Informatics Workshop"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1201\/9781420036275.ch22"},{"key":"ref12","first-page":"71","article-title":"The median problems for breakpoints are NP-complete","author":"pe'er","year":"1998","journal-title":"Elec Colloq on Comput Complexity"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CSB.2003.1227376"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5160929"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2008.2001298"},{"key":"ref16","first-page":"9","article-title":"Fine-grain Parallelism using Multi-core, Cell\/BE, and GPU Systems: Accelerating the Phylogenetic Likelihood Function","author":"patas","year":"2009","journal-title":"Int Conf Parallel Processing"},{"journal-title":"Circuits Multi-Projects","year":"2010","key":"ref17"},{"key":"ref4","first-page":"172","article-title":"The traveling salesman problem: computational solutions for TSP applications","volume":"840","author":"reinelt","year":"1994","journal-title":"LNCS"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.3.694"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0801031"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ref8","first-page":"370","article-title":"Branch-and-bound","author":"horowitz","year":"1984","journal-title":"Fundamentals of Computer Algorithms"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90038-2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.4.4.387"},{"journal-title":"The Traveling Salesman Problem","year":"1985","author":"lawler","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.538"}],"event":{"name":"2010 21st IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)","start":{"date-parts":[[2010,7,7]]},"location":"Rennes, France","end":{"date-parts":[[2010,7,9]]}},"container-title":["ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5523683\/5540749\/05540797.pdf?arnumber=5540797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,19]],"date-time":"2017-03-19T01:06:04Z","timestamp":1489885564000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5540797\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/asap.2010.5540797","relation":{},"subject":[],"published":{"date-parts":[[2010,7]]}}}