{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:25:20Z","timestamp":1725549920662},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540294016"},{"type":"electronic","value":"9783540316619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11567752_8","type":"book-chapter","created":{"date-parts":[[2005,11,3]],"date-time":"2005-11-03T06:56:50Z","timestamp":1131001010000},"page":"113-123","source":"Crossref","is-referenced-by-count":0,"title":["Calculating Genomic Distances in Parallel Using OpenMP"],"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":"Jieyue","family":"He","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":"8_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":"8_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":"8_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/267521.267531","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":"8_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":"8_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)"},{"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":"8_CR6"},{"unstructured":"http:\/\/www.llnl.gov\/computing\/tutorials\/openMP\/","key":"8_CR7"},{"key":"8_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)"},{"unstructured":"http:\/\/www.intel.com\/software\/products\/compilers\/clin\/clinux.htm","key":"8_CR9"},{"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);","key":"#cr-split#-8_CR10.1","DOI":"10.1145\/267521.267544"},{"doi-asserted-by":"crossref","unstructured":"SIAM Journal on Computing 29(3), 880\u2013892 (1999)","key":"#cr-split#-8_CR10.2","DOI":"10.1137\/S0097539798334207"},{"key":"8_CR11","volume-title":"Advanced Computer Architecture \u2013 Parallelism, Scalability, Programmability","author":"K. Hwang","year":"1993","unstructured":"Hwang, K.: Advanced Computer Architecture \u2013 Parallelism, Scalability, Programmability. McGraw-Hill, New York (1993)"},{"unstructured":"Tian, X., Bik, A., Girkar, M., Grey, P., Satio, H., Su, E.: Intel OpenMP C++\/Fortran Compiler for Hyper-Threading Technology: Implementation and Performance. Intel TechnologyJourna (February 2002), http:\/\/developer.intel.com\/technology\/itj\/2002\/volume06issue01\/","key":"8_CR12"},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1093\/genetics\/23.1.28","volume":"23","author":"T. Dobzhansky","year":"1938","unstructured":"Dobzhansky, T., sturtevant, A.H.: Inversions in the Chromosome of Drosophila Pseudoobscura. Genetics\u00a023, 28\u201364 (1938)","journal-title":"Genetics"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-94-011-4309-7_19","volume-title":"Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families","author":"D. Bryant","year":"2000","unstructured":"Bryant, D.: The Complexity of Calculating Exemplar Distances. In: Sankoff, D., Nadeau, J. (eds.) Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pp. 207\u2013212. Kluwer Academic Pubs., Dordrecht (2000)"},{"issue":"11","key":"8_CR15","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1093\/bioinformatics\/15.11.909","volume":"15","author":"D. Sankoff","year":"1999","unstructured":"Sankoff, D.: Genome Rearrangement with Gene Families. Bioinformatics\u00a015(11), 909\u2013917 (1999)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Systems Biology II"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11567752_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T02:45:58Z","timestamp":1626662758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11567752_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540294016","9783540316619"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11567752_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}