{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:49:33Z","timestamp":1648630173207},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,6,1]],"date-time":"2004-06-01T00:00:00Z","timestamp":1086048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":3334,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2004,6]]},"DOI":"10.1016\/s1570-8667(03)00081-9","type":"journal-article","created":{"date-parts":[[2004,5,8]],"date-time":"2004-05-08T08:09:36Z","timestamp":1084003776000},"page":"207-228","source":"Crossref","is-referenced-by-count":0,"title":["Structural properties and tractability results for linear synteny"],"prefix":"10.1016","volume":"2","author":[{"given":"David","family":"Liben-Nowell","sequence":"first","affiliation":[]},{"given":"Jon","family":"Kleinberg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S1570-8667(03)00081-9_BIB001","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/opre.26.1.141","article-title":"Scheduling to minimize maximum cumulative costs subject to series-parallel precedence constraints","volume":"26","author":"Abdel-Wahab","year":"1978","journal-title":"Oper. Res"},{"issue":"2","key":"10.1016\/S1570-8667(03)00081-9_BIB002","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1137\/S0097539793250627","article-title":"Genome rearrangements and sorting by reversals","volume":"25","author":"Bafna","year":"1996","journal-title":"SIAM J. Comput"},{"issue":"2","key":"10.1016\/S1570-8667(03)00081-9_BIB003","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/S089548019528280X","article-title":"Sorting by transpositions","volume":"11","author":"Bafna","year":"1998","journal-title":"SIAM J. Discrete Math"},{"key":"10.1016\/S1570-8667(03)00081-9_BIB004","series-title":"7th Annual Conference on Combinatorial Pattern Matching","first-page":"168","article-title":"Fast sorting by reversals","author":"Berman","year":"1996"},{"issue":"47","key":"10.1016\/S1570-8667(03)00081-9_BIB005","article-title":"1.375-approximation algorithm for sorting by reversals","volume":"8","author":"Berman","year":"2001","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"10.1016\/S1570-8667(03)00081-9_BIB006","doi-asserted-by":"crossref","unstructured":"P. Berman, M. Karpinski, On some tighter inapproximability results, Electronic Colloquium on Computational Complexity, Report No. 29, 1998","DOI":"10.1007\/3-540-48523-6_17"},{"issue":"1","key":"10.1016\/S1570-8667(03)00081-9_BIB007","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/S089548019731994X","article-title":"Sorting permutations by reversals and Eulerian cycle decompositions","volume":"12","author":"Caprara","year":"1999","journal-title":"SIAM J. Discrete Math"},{"key":"10.1016\/S1570-8667(03)00081-9_BIB008","series-title":"9th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"244","article-title":"A 3\/2-approximation algorithm for sorting by reversals","author":"Christie","year":"1998"},{"issue":"1-3","key":"10.1016\/S1570-8667(03)00081-9_BIB009","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0166-218X(98)00066-3","article-title":"On the complexity and approximation of syntenic distance","volume":"88","author":"DasGupta","year":"1998","journal-title":"Discrete Appl. Math"},{"issue":"1","key":"10.1016\/S1570-8667(03)00081-9_BIB010","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1093\/genetics\/147.1.289","article-title":"Synteny conservation and chromosome rearrangements during mammalian evolution","volume":"147","author":"Ehrlich","year":"1997","journal-title":"Genetics"},{"key":"10.1016\/S1570-8667(03)00081-9_BIB011","series-title":"1st Annual Workshop on Algorithms in Bioinformatics","first-page":"227","article-title":"(1+\u03b5)-approximation of sorting by reversals and transpositions","author":"Erikson","year":"2001"},{"issue":"1\u20133","key":"10.1016\/S1570-8667(03)00081-9_BIB012","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0012-365X(01)00150-9","article-title":"Sorting a bridge hand","volume":"241","author":"Eriksson","year":"2001","journal-title":"Discrete Math"},{"key":"10.1016\/S1570-8667(03)00081-9_BIB013","series-title":"7th Annual Symposium on Combinatorial Pattern Matching","first-page":"159","article-title":"Original synteny","author":"Ferretti","year":"1996"},{"key":"10.1016\/S1570-8667(03)00081-9_BIB014","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"2","key":"10.1016\/S1570-8667(03)00081-9_BIB015","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0304-3975(98)00092-9","article-title":"A 2-approximation algorithm for genome rearrangements by reversals and transpositions","volume":"210","author":"Gu","year":"1999","journal-title":"Theoret. Comput. Sci"},{"issue":"1","key":"10.1016\/S1570-8667(03)00081-9_BIB016","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/300515.300516","article-title":"Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals","volume":"46","author":"Hannenhalli","year":"1999","journal-title":"J. ACM"},{"issue":"1\u20132","key":"10.1016\/S1570-8667(03)00081-9_BIB017","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01188586","article-title":"Exact and approximation algorithms for sorting by reversals, with application to genome rearrangment","volume":"13","author":"Kececioglu","year":"1995","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/S1570-8667(03)00081-9_BIB018","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1089\/106652701300099092","article-title":"On the structure of syntenic distance","volume":"8","author":"Liben-Nowell","year":"2001","journal-title":"J. Comp. Bio"},{"key":"10.1016\/S1570-8667(03)00081-9_BIB019","unstructured":"C.L. Monma, J.B. Sidney, A general algorithm for optimal job sequencing with series-parallel precedence constraints, Technical Report 347, School of Operations Research, Cornell University, 1977"},{"issue":"1\u20133","key":"10.1016\/S1570-8667(03)00081-9_BIB020","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0166-218X(96)00067-4","article-title":"Conserved synteny as a measure of genomic distance","volume":"71","author":"Sankoff","year":"1996","journal-title":"Discrete Appl. Math"}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000819?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000819?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T11:10:29Z","timestamp":1623928229000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866703000819"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,6]]}},"alternative-id":["S1570866703000819"],"URL":"https:\/\/doi.org\/10.1016\/s1570-8667(03)00081-9","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2004,6]]}}}