{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T22:22:58Z","timestamp":1767046978611},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,5,8]],"date-time":"2010-05-08T00:00:00Z","timestamp":1273276800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9329-3","type":"journal-article","created":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T14:52:26Z","timestamp":1273243946000},"page":"778-796","source":"Crossref","is-referenced-by-count":5,"title":["The multiple sequence sets: problem and heuristic algorithms"],"prefix":"10.1007","volume":"22","author":[{"given":"Kang","family":"Ning","sequence":"first","affiliation":[]},{"given":"Hon Wai","family":"Leong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,8]]},"reference":[{"key":"9329_CR1","doi-asserted-by":"crossref","unstructured":"Barone P, Bonizzoni P, Vedova GD, Mauri G (2001) An approximation algorithm for the shortest common supersequence problem: an experimental analysis. In: Symposium on applied computing, proceedings of the 2001 ACM symposium on applied computing, pp 56\u201360","DOI":"10.1145\/372202.372275"},{"key":"9329_CR2","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-45450-0_8","volume-title":"Information security and privacy","author":"K Bennett","year":"2002","unstructured":"Bennett K, Grothoff C, Horozov T, Patrascu I (2002) Efficient sharing of encrypted data. In: Information security and privacy. Lecture notes in computer science, vol 2384. Springer, Berlin, pp 107\u2013120"},{"key":"9329_CR3","doi-asserted-by":"crossref","first-page":"3441","DOI":"10.1093\/nar\/22.17.3441","volume":"22","author":"DA Benson","year":"1994","unstructured":"Benson DA, Boguski M, Lipman DJ, Ostell J (1994) GenBank. Nucleic Acids Res 22:3441\u20133444","journal-title":"Nucleic Acids Res"},{"key":"9329_CR4","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press\/McGraw-Hill, New York"},{"key":"9329_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0004-3702(92)90016-Q","volume":"57","author":"DE Foulser","year":"1992","unstructured":"Foulser DE, Li M, Yang Q (1992) Theory and algorithms for plan merging. Artif Intell 57:143\u2013181","journal-title":"Artif Intell"},{"key":"9329_CR6","volume-title":"Computers and intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. Freeman, San Francisco"},{"key":"9329_CR7","first-page":"1","volume":"77","author":"S Hannenhalli","year":"2002","unstructured":"Hannenhalli S, Hubell E, Lipshutz R, Pevzner PA (2002) Combinatorial algorithms for design of DNA arrays. Adv Biochem Eng Biotechnol 77:1\u201319","journal-title":"Adv Biochem Eng Biotechnol"},{"key":"9329_CR8","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1137\/S009753979223842X","volume":"24","author":"T Jiang","year":"1995","unstructured":"Jiang T, Li M (1995) On the approximation of shortest common supersequences and longest common subsequences. SIAM J Comput 24:1122\u20131139","journal-title":"SIAM J Comput"},{"key":"9329_CR9","doi-asserted-by":"crossref","first-page":"e106","DOI":"10.1093\/nar\/gnf105","volume":"30","author":"S Kasif","year":"2002","unstructured":"Kasif S, Weng Z, Derti A, Beigel R, DeLisi C (2002) A computational framework for optimal masking in the synthesis of oligonucleotide microarrays. Nucleic Acids Res 30:e106","journal-title":"Nucleic Acids Res"},{"key":"9329_CR10","doi-asserted-by":"crossref","first-page":"e144","DOI":"10.1093\/nar\/gni147","volume":"33","author":"K Ning","year":"2005","unstructured":"Ning K, Choi KP, Leong HW, Zhang L (2005) A post processing method for optimizing synthesis strategy for oligonucleotide microarrays. Nucleic Acids Res 33:e144","journal-title":"Nucleic Acids Res"},{"issue":"Suppl 4","key":"9329_CR11","doi-asserted-by":"crossref","first-page":"S12","DOI":"10.1186\/1471-2105-7-S4-S12","volume":"7","author":"K Ning","year":"2006","unstructured":"Ning K, Leong HW (2006) The distribution and deposition method for the multiple oligo nucleotide arrays. BMC Bioinform 7(Suppl 4):S12","journal-title":"BMC Bioinform"},{"key":"9329_CR12","volume-title":"Primer3 on the WWW for general users and for biologist programmers","author":"S Rozen","year":"2000","unstructured":"Rozen S, Skaletsky HJ (2000) Primer3 on the WWW for general users and for biologist programmers. Humana Press, Totowa"},{"key":"9329_CR13","volume-title":"Time warps, string edits and macromolecules: the theory and practice of sequence comparisons","author":"D Sankoff","year":"1983","unstructured":"Sankoff D, Kruskal J (1983) Time warps, string edits and macromolecules: the theory and practice of sequence comparisons. Addison-Wesley, Reading"},{"key":"9329_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/42201.42203","volume":"13","author":"TK Sellis","year":"1988","unstructured":"Sellis TK (1988) Multiple-query optimization. ACM Trans Database Syst (TODS) 13:23\u201352","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"9329_CR15","volume-title":"Data compression: methods and theory","author":"JA Storer","year":"1988","unstructured":"Storer JA (1988) Data compression: methods and theory. Computer Science Press, New York"},{"key":"9329_CR16","unstructured":"Timkovsky VG (1993) On the approximation of shortest common non-subsequences and supersequences. Technical report"},{"key":"9329_CR17","doi-asserted-by":"crossref","first-page":"119","DOI":"10.2307\/3001946","volume":"3","author":"F Wilcoxin","year":"1947","unstructured":"Wilcoxin F (1947) Probability tables for individual comparisons by ranking methods. Biometrics 3:119\u2013122","journal-title":"Biometrics"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9329-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9329-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9329-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:14Z","timestamp":1559276594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9329-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,8]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9329"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9329-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,8]]}}}