{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:00:40Z","timestamp":1725559240571},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260431"},{"type":"electronic","value":"9783540321149"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11428848_127","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T13:44:33Z","timestamp":1279115073000},"page":"1003-1010","source":"Crossref","is-referenced-by-count":0,"title":["A Parallel Implementation for Determining Genomic Distances Under Deletion and Insertion"],"prefix":"10.1007","author":[{"given":"Vijaya Smitha","family":"Kolli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michelle Hong","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"127_CR1","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"D.A. Bader","year":"2001","unstructured":"Bader, D.A., Moret, B.M.E., Yan, M.: A fast linear-time algorithm for inversion distance with an experimental comparison. J. Comput. Biol.\u00a08(5), 483\u2013491 (2001)","journal-title":"J. Comput. Biol."},{"key":"127_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-45071-8_54","volume-title":"Computing and Combinatorics","author":"M. Marron","year":"2003","unstructured":"Marron, M., Sweson, K.M., Moret, B.M.E.: Genomic Distances under Deletions and Insertions. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 537\u2013547. Springer, Heidelberg (2003)"},{"key":"127_CR3","first-page":"75","volume-title":"Proc. 1st Int\u2019l Conf. on Comput.Mol. Biol. RECOMB 1997","author":"A. Caprara","year":"1997","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: Proc. 1st Int\u2019l Conf. on Comput. Mol. Biol. RECOMB 1997, pp. 75\u201383. ACM Press, New York (1997)"},{"key":"127_CR4","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1145\/225058.225112","volume-title":"Proc. 27th Ann.Symp. Theory of Computing STOC 1995","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In: Proc. 27th Ann. Symp. Theory of Computing STOC 1995, pp. 178\u2013189. ACM Press, New York (1995)"},{"key":"127_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45123-4_20","volume-title":"Combinatorial Pattern Matching","author":"N. El-Mabrouk","year":"2000","unstructured":"El-Mabrouk, N.: Genome rearrangement by reversals and insertions\/deletions of contiguous segments. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 222\u2013234. Springer, Heidelberg (2000)"},{"key":"127_CR6","unstructured":"Liu, T., Moret, B.M.E., Bader, D.A.: An exact linear-time algorithm for computing genomic distances under inversions and deletions U. New Mexico, TR-CS-2003-31"},{"key":"127_CR7","unstructured":"Tutorial on OpenMP, http:\/\/www.llnl.gov\/computing\/tutorials\/openMP\/"},{"key":"127_CR8","volume-title":"Parallel Programming in C with MPI and OpenMP","author":"M. Quinn","year":"2004","unstructured":"Quinn, M.: Parallel Programming in C with MPI and OpenMP. The McGraw-Hill Companies, New York (2004)"},{"key":"127_CR9","unstructured":"Intel C++ Compiler for Linux, http:\/\/www.intel.com\/software\/products\/compilers\/clin\/clinux.htm"},{"key":"#cr-split#-127_CR10.1","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. In: Proc. SODA 1997, pp. 344\u2013351 (1997);","DOI":"10.1145\/267521.267544"},{"key":"#cr-split#-127_CR10.2","doi-asserted-by":"crossref","unstructured":"SIAM Journal on Computing 29(3), 880\u2013892 (1999)","DOI":"10.1137\/S0097539798334207"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11428848_127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:07:27Z","timestamp":1559254047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11428848_127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260431","9783540321149"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11428848_127","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}