{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:17Z","timestamp":1759638197129},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404528"},{"type":"electronic","value":"9783642404535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40453-5_19","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T03:09:49Z","timestamp":1376622589000},"page":"244-258","source":"Crossref","is-referenced-by-count":13,"title":["A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Bulteau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irena","family":"Rusu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"19_CR1","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.: Assignment of orthologous genes via genome rearrangement. IEEE\/ACM T. Comput. Bi.\u00a02(4), 302\u2013315 (2005)","journal-title":"IEEE\/ACM T. Comput. Bi."},{"key":"19_CR2","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-87361-7_8","volume-title":"Algorithms in Bioinformatics","author":"P. Damaschke","year":"2008","unstructured":"Damaschke, P.: Minimum common string partition parameterized. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol.\u00a05251, pp. 87\u201398. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. Computational Molecular Biology (2009)","key":"19_CR3","DOI":"10.7551\/mitpress\/9780262062824.001.0001"},{"issue":"9","key":"19_CR4","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1089\/cmb.2007.0048","volume":"14","author":"Z. Fu","year":"2007","unstructured":"Fu, Z., Chen, X., Vacic, V., Nan, P., Zhong, Y., Jiang, T.: MSOAR: A high-throughput ortholog assignment system based on genome rearrangement. J.\u00a0Comput.\u00a0Biol.\u00a014(9), 1160\u20131175 (2007)","journal-title":"J.\u00a0Comput.\u00a0Biol."},{"doi-asserted-by":"crossref","unstructured":"Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partition problem: Hardness and approximations. Electron.\u00a0J.\u00a0Comb.\u00a012 (2005)","key":"19_CR5","DOI":"10.1007\/978-3-540-30551-4_43"},{"key":"19_CR6","first-page":"519","volume":"23","author":"H. Jiang","year":"2012","unstructured":"Jiang, H., Zhu, B., Zhu, D., Zhu, H.: Minimum common string partition revisited. J.\u00a0Comb.\u00a0Optim.\u00a023, 519\u2013527 (2012)","journal-title":"J.\u00a0Comb.\u00a0Optim."},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s11390-010-9304-6","volume":"25","author":"T. Jiang","year":"2010","unstructured":"Jiang, T.: Some algorithmic challenges in genome-wide ortholog assignment. J. Comput. Sci. Technol.\u00a025(1), 42\u201352 (2010)","journal-title":"J. Comput. Sci. Technol."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1093\/nar\/gkr895","volume":"40","author":"P.J. Kersey","year":"2012","unstructured":"Kersey, P.J., Staines, D.M., Lawson, D., Kulesha, E., Derwent, P., Humphrey, J.C., Hughes, D.S.T., Keenan, S., Kerhornou, A., Koscielny, G., Langridge, N., McDowall, M.D., Megy, K., Maheswari, U., Nuhn, M., Paulini, M., Pedro, H., Toneva, I., Wilson, D., Yates, A., Birney, E.: Ensembl genomes: an integrative resource for genome-scale data from non-vertebrate species. Nucleic Acids Res.\u00a040(Database-Issue), 91\u201397 (2012)","journal-title":"Nucleic Acids Res."},{"doi-asserted-by":"crossref","unstructured":"Kolman, P., Walen, T.: Reversal distance for strings with duplicates: Linear time approximation using hitting set. Electr. J. Comb.\u00a014(1) (2007)","key":"19_CR9","DOI":"10.1007\/11970125_22"},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(96)00268-X","volume":"181","author":"D.P. Lopresti","year":"1997","unstructured":"Lopresti, D.P., Tomkins, A.: Block edit models for approximate string matching. Theor. Comput. Sci.\u00a0181(1), 159\u2013179 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"19_CR11","doi-asserted-by":"publisher","first-page":"2896","DOI":"10.1073\/pnas.96.6.2896","volume":"96","author":"R. Overbeek","year":"1999","unstructured":"Overbeek, R., Fonstein, M., D\u2019Souza, M., Pusch, G.D., Maltsev, N.: The use of gene clusters to infer functional coupling. PNAS\u00a096(6), 2896\u20132901 (1999)","journal-title":"PNAS"},{"issue":"5","key":"19_CR12","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.E., Sonnhammer, E.L., et al.: Automatic clustering of orthologs and in-paralogs from pairwise species comparisons. J.\u00a0Mol.\u00a0Biol.\u00a0314(5), 1041\u20131052 (2001)","journal-title":"J.\u00a0Mol.\u00a0Biol."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1186\/1471-2105-11-10","volume":"11","author":"G. Shi","year":"2010","unstructured":"Shi, G., Zhang, L., Jiang, T.: MSOAR 2.0: Incorporating tandem duplications into ortholog assignment based on genome rearrangement. BMC Bioinformatics\u00a011, 10 (2010)","journal-title":"BMC Bioinformatics"},{"doi-asserted-by":"crossref","unstructured":"Shi, G., Peng, M.-C., Jiang, T.: Multimsoar 2.0: An accurate tool to identify ortholog groups among multiple genomes. PloS One\u00a06(6), e20892 (2011)","key":"19_CR14","DOI":"10.1371\/journal.pone.0020892"},{"doi-asserted-by":"crossref","unstructured":"Swenson, K.M., Marron, M., Earnest-DeYoung, J.V., Moret, B.M.E.: Approximating the true evolutionary distance between two genomes. ACM J. Exp. Alg.\u00a012 (2008)","key":"19_CR15","DOI":"10.1145\/1227161.1402297"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1093\/nar\/29.1.22","volume":"29","author":"R.L. Tatusov","year":"2001","unstructured":"Tatusov, R.L., Natale, D.A., Garkavtsev, I.V., Tatusova, T.A., Shankavaram, U.T., Rao, B.S., Kiryutin, B., Galperin, M.Y., Fedorova, N.D., Koonin, E.V.: The COG database: new developments in phylogenetic classification of proteins from complete genomes. Nucleic Acids Res.\u00a029(1), 22\u201328 (2001)","journal-title":"Nucleic Acids Res."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40453-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T16:52:20Z","timestamp":1558025540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40453-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404528","9783642404535"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40453-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}