{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:45:42Z","timestamp":1764557142655},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_24","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T06:34:15Z","timestamp":1149230055000},"page":"236-247","source":"Crossref","is-referenced-by-count":6,"title":["On the Minimum Common Integer Partition Problem"],"prefix":"10.1007","author":[{"given":"Xin","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)"},{"key":"24_CR2","volume-title":"The Theory of Partitions","author":"G.E. Andrews","year":"1976","unstructured":"Andrews, G.E.: The Theory of Partitions. Addison-Wesley, Reading (1976)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1287\/moor.23.3.640","volume":"23","author":"E.M. Arkin","year":"1998","unstructured":"Arkin, E.M., Hassin, R.: On local search for weighted packing problems. Math. Oper. Res.\u00a023, 640\u2013648 (1998)","journal-title":"Math. Oper. Res."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Andrews, G.E., Eriksson, K.: The Integer Partitions. Cambridge (2004)","DOI":"10.1017\/CBO9781139167239"},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1137\/0149012","volume":"49","author":"S. Altschul","year":"1989","unstructured":"Altschul, S., Lipman, D.: Trees, stars, and multiple sequence alignment. SIAM Journal on Applied Math.\u00a049(1), 197\u2013209 (1989)","journal-title":"SIAM Journal on Applied Math."},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-27821-4_8","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Chrobak","year":"2004","unstructured":"Chrobak, M., Lolman, P., Sgall, J.: The greedy algorithm for the minimum common string partition problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 84\u201395. Springer, Heidelberg (2004)"},{"key":"24_CR7","first-page":"1017","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn., p. 1017. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Chen, X.: The minimum common partition problem revisited (manuscript, 2005)","DOI":"10.1007\/11758471_24"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Computing the assignment of orthologous genes via genome rearrangement. In: Proc. of 3rd Asia Pacific Bioinformatics Conference (APBC 2005), pp. 363\u2013378 (2005)","DOI":"10.1142\/9781860947322_0037"},{"issue":"4","key":"24_CR10","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TCBB.2005.48","volume":"2","author":"X. Chen","year":"2005","unstructured":"Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: The assignment of orthologous genes via genome rearrangement. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a02(4), 302\u2013315 (2005)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"24_CR11","unstructured":"Fu, Z.: Assignment of orthologous genes for multichromosomal genomes using genome rearrangement. UCR CS Technical report (2004)"},{"key":"24_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Tree, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Tree, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-30551-4_43","volume-title":"Algorithms and Computation","author":"A. Goldstein","year":"2004","unstructured":"Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partition problem: hardness and approximations. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 484\u2013495. Springer, Heidelberg (2004)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In: Proc. 27th Ann. ACM Symp. Theory of Comput. (STOC 1995), pp. 178\u2013189 (1995)","DOI":"10.1145\/225058.225112"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C. Hurkens","year":"1989","unstructured":"Hurkens, C., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Discrete Mathematics\u00a02, 68\u201372 (1989)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/11549345_50","volume-title":"Mathematical Foundations of Computer Science 2005","author":"P. Kolman","year":"2005","unstructured":"Kolman, P.: Approximating reversal distance for strings with bounded number of duplicates in linear time. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 580\u2013590. Springer, Heidelberg (2005)"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V. Kann","year":"1991","unstructured":"Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters\u00a037, 27\u201335 (1991)","journal-title":"Information Processing Letters"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Computer and System Sciences\u00a043, 425\u2013440 (1991)","journal-title":"J. Computer and System Sciences"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1006\/jmbi.2000.5197","volume":"314","author":"M. Remm","year":"2001","unstructured":"Remm, M., Storm, C., Sonnhammer, E.: Automatic clustering of orthologs and in-paralogs from pairwise species comparisons. J. Mol. Biol.\u00a0314, 1041\u20131052 (2001)","journal-title":"J. Mol. Biol."},{"key":"24_CR20","first-page":"461","volume":"47","author":"D. Sankoff","year":"1989","unstructured":"Sankoff, D.: Mechanisms of genome evolution: models and inference. Bull. Int. Stat. Instit.\u00a047, 461\u2013475 (1989)","journal-title":"Bull. Int. Stat. Instit."},{"key":"24_CR21","first-page":"569","volume-title":"Molecular Microbial Ecology Manual","author":"L. Valinsky","year":"2004","unstructured":"Valinsky, L., Scupham, A., Vedova, G.D., Liu, Z., Figueroa, A., Jampachaisri, K., Yin, B., Bent, E., Mancini-Jones, R., Press, J., Jiang, T., Borneman, J.: Oligonucleotide Fingerprinting of Ribosomal RNA Genes (OFRG). In: Kowalchuk, G.A., de Bruijn, F.J., Head, I.M., Akkermans, A.D.L., van Elsas, J.D. (eds.) Molecular Microbial Ecology Manual, 2nd edn., pp. 569\u2013585. Kluwer Academic Publishers, Dordrecht (2004)","edition":"2"},{"key":"24_CR22","unstructured":"Available at: http:\/\/www.cs.ucr.edu\/~lliu\/paper\/mcip_ciac_full.pdf"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T12:12:09Z","timestamp":1683461529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11758471_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}