{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:03:33Z","timestamp":1649214213622},"reference-count":8,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,4,1]],"date-time":"1987-04-01T00:00:00Z","timestamp":544233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9604,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1987,4]]},"DOI":"10.1016\/0012-365x(87)90193-2","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"239-252","source":"Crossref","is-referenced-by-count":0,"title":["Shortest prefix strings containing all subset permutations"],"prefix":"10.1016","volume":"64","author":[{"given":"Alejandro A","family":"Sch\u00e4ffer","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(87)90193-2_BIB1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(74)90116-2","article-title":"Short Permutation Strings","volume":"10","author":"Adleman","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(87)90193-2_BIB2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0012-365X(82)90155-8","article-title":"A new bound on the length of the shortest string containing all r-permutations","volume":"39","author":"Cai","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(87)90193-2_BIB3","unstructured":"V. Chv\u00e1tal, D.A. Klarner and D.E. Knuth, Selected combinatorial research problems, Technical report CS-72-292, Stanford University."},{"key":"10.1016\/0012-365X(87)90193-2_BIB4","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0130040","article-title":"On permutation embedding sequences","volume":"30","author":"Galbiati","year":"1976","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(87)90193-2_BIB5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0097-3165(76)90057-1","article-title":"A lower bound on the length of a sequence containing all permutations as subsequences","volume":"21","author":"Kleitman","year":"1976","journal-title":"J. of Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(87)90193-2_BIB6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0012-365X(75)90004-7","article-title":"Shortest string containing all permutations","volume":"11","author":"Koutas","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(87)90193-2_BIB7","unstructured":"M. Newey, Notes on a problem involving permutations as subsequences, Technical Report CS-73-340, Stanford University."},{"key":"10.1016\/0012-365X(87)90193-2_BIB8","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(82)90224-2","article-title":"Short strings containing all k-element permutations","volume":"42","author":"Savage","year":"1982","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87901932?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87901932?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:54:17Z","timestamp":1553946857000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X87901932"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,4]]},"references-count":8,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987,4]]}},"alternative-id":["0012365X87901932"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(87)90193-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,4]]}}}