{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T22:01:16Z","timestamp":1715032876476},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,2,16]],"date-time":"1999-02-16T00:00:00Z","timestamp":919123200000},"content-version":"vor","delay-in-days":107,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,11]]},"DOI":"10.1016\/s0166-218x(98)00066-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"59-82","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":22,"title":["On the complexity and approximation of syntenic distance"],"prefix":"10.1016","volume":"88","author":[{"given":"Bhaskar","family":"Dasgupta","sequence":"first","affiliation":[]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Sampath","family":"Kannan","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[]},{"given":"Elizabeth","family":"Sweedyk","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00066-3_BIB1","unstructured":"A. Ambainis, personal e-mail communication."},{"key":"10.1016\/S0166-218X(98)00066-3_BIB2","series-title":"34th IEEE Symp. on Foundations of Computer Science","first-page":"148","article-title":"Genome rearrangements and sorting by reversals","author":"Bafna","year":"1993"},{"key":"10.1016\/S0166-218X(98)00066-3_BIB3","first-page":"239","article-title":"Sorting by reversals: genome rearrangements in plant organelles and evolutionary history of X chromosome","volume":"12","author":"Bafna","year":"1995","journal-title":"Mol. Biol. Evol."},{"key":"10.1016\/S0166-218X(98)00066-3_BIB4","series-title":"Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms","first-page":"614","article-title":"Sorting by transpositions","author":"Bafna","year":"1995"},{"key":"10.1016\/S0166-218X(98)00066-3_BIB5","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0166-218X(98)00066-3_BIB6","series-title":"Proc. 7th Annual Symp. on Combinatorial Pattern Matching","first-page":"159","article-title":"Original synteny","author":"Ferretti","year":"1996"},{"key":"10.1016\/S0166-218X(98)00066-3_BIB7","series-title":"Computers and Intractability: A guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(98)00066-3_BIB8","series-title":"Proc. 27th Annual ACM Symp. on Theory of Computing","first-page":"178","article-title":"Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals)","author":"Hannenhalli","year":"1995"},{"key":"10.1016\/S0166-218X(98)00066-3_BIB9","unstructured":"S. Kannan, Z. Sweedyk, A separator theorem for directed acyclic graphs, Technical Report MS-CIS-96-20, University of Pennsylvania."},{"key":"10.1016\/S0166-218X(98)00066-3_BIB10","series-title":"Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"604","article-title":"Of mice and men: evolutionary distances between genomes under translocation","author":"Kececioglu","year":"1995"},{"key":"10.1016\/S0166-218X(98)00066-3_BIB11","series-title":"Proc 4th Annual Symp. on Combinatorial Pattern Matching","first-page":"87","article-title":"Exact and approximation algorithms for the inversion distance between two permutations","volume":"vol. 684","author":"Kececioglu","year":"1993"},{"key":"10.1016\/S0166-218X(98)00066-3_BIB12","series-title":"proc. 5th Annual Symp. on Combinatorial Pattern Matching","first-page":"307","article-title":"Efficient bounds for oriented chromosome inversion distance","volume":"vol. 807","author":"Kececioglu","year":"1994"},{"issue":"1\/2","key":"10.1016\/S0166-218X(98)00066-3_BIB13","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01188586","article-title":"Exact and approximation algorithms for sorting by reversals, with applications to genome rearrangements","volume":"13","author":"Kececioglu","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(98)00066-3_BIB14","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000663?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000663?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T15:12:02Z","timestamp":1698765122000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000663"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0166218X98000663"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00066-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the complexity and approximation of syntenic distance","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(98)00066-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}