{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T23:05:18Z","timestamp":1746313518057,"version":"3.37.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1109\/ipdps.2009.5161113","type":"proceedings-article","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T19:56:45Z","timestamp":1248119805000},"page":"1-8","source":"Crossref","is-referenced-by-count":8,"title":["Exact pairwise alignment of megabase genome biological sequences using a novel z-align parallel strategy"],"prefix":"10.1109","author":[{"given":"Azzedine","family":"Boukerche","sequence":"first","affiliation":[]},{"given":"Rodolfo Bezerra","family":"Batista","sequence":"additional","affiliation":[]},{"given":"Alba Cristina Magalhaes Alves","family":"de Melo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"0","key":"19"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1016\/0022-2836(81)90087-5"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1109\/12.55693"},{"year":"1995","author":"pfister","journal-title":"In Search of Clusters The Coming Battle for Lowly Parallel Computing","key":"15"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1109\/TPDS.2004.86"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1145\/375360.375365"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"11","doi-asserted-by":"crossref","first-page":"429","DOI":"10.3233\/ISB-00107","article-title":"accelerating comparative genomics using parallel computing","volume":"3","author":"janaki","year":"2003","journal-title":"In Silico Biology"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1093\/bioinformatics\/4.1.11"},{"key":"3","first-page":"464","article-title":"parallel strategies for local dna comparison in a cluster of workstations, in 4th int. workshop on experimental algorithms","volume":"3503","author":"boukerche","year":"2005","journal-title":"LNCS"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1016\/j.jpdc.2007.08.007"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1006\/jmbi.1990.9999"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1109\/ISPDC.2007.58"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1016\/0022-2836(82)90398-9"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1093\/nar\/12.1Part1.175"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1109\/ICPP.2003.1240565"},{"key":"4","article-title":"computing large-scale alignments on a multi-cluster","author":"chen","year":"2003","journal-title":"IEEE Int Conf Cluster Computing"},{"key":"9","volume":"18","author":"hirschberg","year":"1975","journal-title":"A linear space algorithm for computing longest common subsequences"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1017\/CBO9780511574931"}],"event":{"name":"Distributed Processing (IPDPS)","start":{"date-parts":[[2009,5,23]]},"location":"Rome, Italy","end":{"date-parts":[[2009,5,29]]}},"container-title":["2009 IEEE International Symposium on Parallel & Distributed Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5136864\/5160846\/05161113.pdf?arnumber=5161113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T05:34:55Z","timestamp":1739252095000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5161113\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2009.5161113","relation":{},"subject":[],"published":{"date-parts":[[2009,5]]}}}