{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:43:35Z","timestamp":1649105015430},"reference-count":3,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,8]]},"abstract":"<jats:p> A signed n-permutation is a permutation on {1,2,\u2026,n} in which each element is labelled by a positive or negative sign. Here we consider the problem of sorting signed permutations by fixed-length reversals. Indeed, limiting the transformations to reversals of length exactly k can be very restrictive, for example, (+1,+3,+2,+4,\u2026,+n) can never be sorted to (+1,+2,+3,+4,\u2026,+n) by 2-reversals. That is, for given two signed permutations it is not obvious whether they can be sorted to each other by k-reversals. Thus in 1996, Chen and Skiena gave the following open problem: what is the connectedness of signed permutations under fixed-length reversals? In this paper, we resolve this open problem when \"fixed-length\" is even, and give a characterization of the connectedness of signed n-permutations under 2l-reversal, for both linear and circular permutations. <\/jats:p>","DOI":"10.1142\/s0129054106004194","type":"journal-article","created":{"date-parts":[[2006,8,4]],"date-time":"2006-08-04T22:37:04Z","timestamp":1154731024000},"page":"933-948","source":"Crossref","is-referenced-by-count":0,"title":["SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS"],"prefix":"10.1142","volume":"17","author":[{"given":"XINGQIN","family":"QI","sequence":"first","affiliation":[{"name":"School of Mathematics and System Sciences, Shandong University, Jinan, 250100, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GUOJUN","family":"LI","sequence":"additional","affiliation":[{"name":"School of Mathematics and System Sciences, Shandong University, Jinan, 250100, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JICHANG","family":"WU","sequence":"additional","affiliation":[{"name":"School of Mathematics and System Sciences, Shandong University, Jinan, 250100, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BINGQIANG","family":"LIU","sequence":"additional","affiliation":[{"name":"School of Mathematics and System Sciences, Shandong University, Jinan, 250100, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1089\/106652701753216503"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00069-8"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798334207"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106004194","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:40:34Z","timestamp":1565138434000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106004194"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8]]},"references-count":3,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,8]]}},"alternative-id":["10.1142\/S0129054106004194"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106004194","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8]]}}}