[{"datePdeleted":"2011-08-09 09:55:25","_id":"1589663","id":"1589663","quality_controlled":"1","publication_identifier":{"issn":["0304-3975"]},"doi":"10.1016/j.tcs.2009.09.008","issue":"51","first_author":"Bergeron, Anne","intvolume":" 410","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2445157"}]},"publication":"Theoretical Computer Science","isi":"1","language":[{"iso":"eng"}],"department":[{"_id":"33067262"},{"_id":"441317"},{"_id":"66100"}],"article_type":"original","date_submitted":"2011-08-09T09:29:29Z","year":"2009","volume":"410","date_created":"2010-04-26T09:45:03Z","page":"5300-5316","external_id":{"isi":["000271840900002"]},"type":"journal_article","publisher":"Elsevier BV","status":"public","author":[{"autoren_ansetzung":["Bergeron, Anne","Bergeron","Anne Bergeron","Bergeron, A","Bergeron, A.","A Bergeron","A. Bergeron"],"full_name":"Bergeron, Anne","last_name":"Bergeron","first_name":"Anne"},{"first_name":"Julia","full_name":"Mixtacki, Julia","last_name":"Mixtacki","autoren_ansetzung":["Mixtacki, Julia","Mixtacki","Julia Mixtacki","Mixtacki, J","Mixtacki, J.","J Mixtacki","J. Mixtacki"]},{"first_name":"Jens","orcid_put_code_url":"https://api.orcid.org/v2.0/0000-0002-4656-7155/work/35435038","last_name":"Stoye","orcid":"0000-0002-4656-7155","full_name":"Stoye, Jens","autoren_ansetzung":["Stoye, Jens","Stoye","Jens Stoye","Stoye, J","Stoye, J.","J Stoye","J. Stoye"],"id":"65864"}],"publication_status":"published","citation":{"default":"Bergeron A, Mixtacki J, Stoye J (2009)

*Theoretical Computer Science* 410(51): 5300-5316.","ieee":" A. Bergeron, J. Mixtacki, and J. Stoye, “A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance”, *Theoretical Computer Science*, vol. 410, 2009, pp. 5300-5316.","lncs":" Bergeron, A., Mixtacki, J., Stoye, J.: A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance. Theoretical Computer Science. 410, 5300-5316 (2009).","apa":"Bergeron, A., Mixtacki, J., & Stoye, J. (2009). A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance. *Theoretical Computer Science*, *410*(51), 5300-5316. doi:10.1016/j.tcs.2009.09.008","apa_indent":"Bergeron, A., Mixtacki, J., & Stoye, J. (2009). A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance. *Theoretical Computer Science*, *410*(51), 5300-5316. doi:10.1016/j.tcs.2009.09.008

","chicago":"Bergeron, Anne, Mixtacki, Julia, and Stoye, Jens. 2009. “A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance”. *Theoretical Computer Science* 410 (51): 5300-5316.

","frontiers":"Bergeron, A., Mixtacki, J., and Stoye, J. (2009). A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance. *Theoretical Computer Science* 410, 5300-5316.","wels":"Bergeron, A.; Mixtacki, J.; Stoye, J. (2009): A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance *Theoretical Computer Science*,410:(51): 5300-5316.","ama":"Bergeron A, Mixtacki J, Stoye J. A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance. *Theoretical Computer Science*. 2009;410(51):5300-5316.","angewandte-chemie":"A. Bergeron, J. Mixtacki, and J. Stoye, “A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance”, *Theoretical Computer Science*, **2009**, *410*, 5300-5316.","dgps":"Bergeron, A., Mixtacki, J. & Stoye, J. (2009). A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance. *Theoretical Computer Science*, *410*(51), 5300-5316. Elsevier BV. doi:10.1016/j.tcs.2009.09.008.

","aps":" A. Bergeron, J. Mixtacki, and J. Stoye, A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance, Theoretical Computer Science **410**, 5300 (2009).","bio1":"Bergeron A, Mixtacki J, Stoye J (2009)

A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance.

Theoretical Computer Science 410(51): 5300-5316.","mla":"Bergeron, Anne, Mixtacki, Julia, and Stoye, Jens. “A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance”. *Theoretical Computer Science* 410.51 (2009): 5300-5316.","harvard1":"Bergeron, A., Mixtacki, J., & Stoye, J., 2009. A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance. *Theoretical Computer Science*, 410(51), p 5300-5316."},"title":"A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance","accept":"1","keyword":["Genomic distance","Sorting by translocations","Comparative genomics","Genome rearrangements","fissions and inversions","fusions","computation"],"date_updated":"2018-07-24T12:58:39Z"}]