{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T23:10:23Z","timestamp":1743376223327,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642312649"},{"type":"electronic","value":"9783642312656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31265-6_33","type":"book-chapter","created":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T03:28:23Z","timestamp":1339471703000},"page":"413-426","source":"Crossref","is-referenced-by-count":8,"title":["On the Closest String via Rank Distance"],"prefix":"10.1007","author":[{"given":"Liviu P.","family":"Dinu","sequence":"first","affiliation":[]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","volume-title":"Social Choice and Indivudual Values","author":"K.J. Arrow","year":"1963","unstructured":"Arrow, K.J.: Social Choice and Indivudual Values. Wiley, New York (1963)"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-63220-4_63","volume-title":"Combinatorial Pattern Matching","author":"A. Ben-Dor","year":"1997","unstructured":"Ben-Dor, A., Lancia, G., Perone, J., Ravi, R.: Banishing Bias from Consensus Sequences. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol.\u00a01264, pp. 247\u2013261. Springer, Heidelberg (1997)"},{"issue":"1","key":"33_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.disopt.2007.11.002","volume":"5","author":"Y. Berstein","year":"2008","unstructured":"Berstein, Y., Onn, S.: Nonlinear bipartite matching. Disc. Optim.\u00a05(1), 53\u201365 (2008)","journal-title":"Disc. Optim."},{"issue":"1-2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0304-3975(97)00240-5","volume":"230","author":"C. Higuera de la","year":"2000","unstructured":"de la Higuera, C., Casacuberta, F.: Topology of Strings: Median String is NP-Complete. Theor. Comput. Sci.\u00a0230(1-2), 39\u201348 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"33_CR5","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/S0097539701397825","volume":"32","author":"X. Deng","year":"2003","unstructured":"Deng, X., Li, G., Li, Z., Ma, B., Wang, L.: Genetic design of drugs without side-effects. SIAM J. Comput.\u00a032(4), 1073\u20131090 (2003)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"33_CR6","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","volume":"39","author":"P. Diaconis","year":"1977","unstructured":"Diaconis, P., Graham, R.L.: Spearman\u2019s footrule as a measure of disarray. J. Royal Statist. Soc. Series B (Methodological)\u00a039(2), 262\u2013268 (1977)","journal-title":"J. Royal Statist. Soc. Series B (Methodological)"},{"issue":"1","key":"33_CR7","first-page":"39","volume":"55","author":"L.P. Dinu","year":"2003","unstructured":"Dinu, L.P.: On the classification and aggregation of hierarchies with different constitutive elements. Fundam. Inform.\u00a055(1), 39\u201350 (2003)","journal-title":"Fundam. Inform."},{"issue":"1-3","key":"33_CR8","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.tcs.2006.05.024","volume":"359","author":"L.P. Dinu","year":"2006","unstructured":"Dinu, L.P., Manea, F.: An efficient approach for the rank aggregation problem. Theor. Comput. Sci.\u00a0359(1-3), 455\u2013461 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"33_CR9","doi-asserted-by":"crossref","first-page":"361","DOI":"10.3233\/FUN-2006-73302","volume":"73","author":"L.P. Dinu","year":"2006","unstructured":"Dinu, L.P., Sgarro, A.: A low-complexity distance for dna strings. Fundam. Inform.\u00a073(3), 361\u2013372 (2006)","journal-title":"Fundam. Inform."},{"issue":"2","key":"33_CR10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M. Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theory Comput. Syst.\u00a030(2), 113\u2013119 (1997)","journal-title":"Theory Comput. Syst."},{"key":"33_CR11","unstructured":"Gramm, J., Huffner, F., Niedermeier, R.: Closest strings, primer design, and motif search. currents in computational molecular biology. In: RECOMB, pp. 74\u201375 (2002)"},{"issue":"1","key":"33_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"J.K. Lanctot","year":"2003","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inf. Comput.\u00a0185(1), 41\u201355 (2003)","journal-title":"Inf. Comput."},{"issue":"1","key":"33_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jcss.2002.1823","volume":"65","author":"M. Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: Finding similar regions in many sequences. J. Comput. Syst. Sci.\u00a065(1), 73\u201396 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"33_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/11527503_70","volume-title":"Advanced Data Mining and Applications","author":"X. Liu","year":"2005","unstructured":"Liu, X., He, H., S\u00fdkora, O.: Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem. In: Li, X., Wang, S., Dong, Z.Y. (eds.) ADMA 2005. LNCS (LNAI), vol.\u00a03584, pp. 591\u2013597. Springer, Heidelberg (2005)"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-44888-8_23","volume-title":"Combinatorial Pattern Matching","author":"F. Nicolas","year":"2003","unstructured":"Nicolas, F., Rivals, E.: Complexities of the Centre and Median String Problems. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 315\u2013327. Springer, Heidelberg (2003)"},{"issue":"2-4","key":"33_CR16","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.jda.2004.08.015","volume":"3","author":"F. Nicolas","year":"2005","unstructured":"Nicolas, F., Rivals, E.: Hardness results for the center and median string problems under the weighted and unweighted edit distances. J. Disc. Alg.\u00a03(2-4), 390\u2013415 (2005)","journal-title":"J. Disc. Alg."},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF02143500","volume":"28","author":"J. Palmer","year":"1988","unstructured":"Palmer, J., Herbon, L.: Plant mitochondrial dna evolves rapidly in structure, but slowly in sequence. J. Mol. Evol.\u00a028, 87\u201389 (1988)","journal-title":"J. Mol. Evol."},{"issue":"1-3","key":"33_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2007.05.029","volume":"385","author":"V.Y. Popov","year":"2007","unstructured":"Popov, V.Y.: Multiple genome rearrangement by swaps and by element duplications. Theor. Comput. Sci.\u00a0385(1-3), 115\u2013126 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR19","unstructured":"Schwarz, N.: Rank aggregation by criteria. Minimizing the maximum Kendall-tau distance. Diplomarbeit, Jena (2009)"},{"issue":"5","key":"33_CR20","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1142\/S0219720005001508","volume":"3","author":"L. Wang","year":"2005","unstructured":"Wang, L., Dong, L.: Randomized algorithms for motif detection. J. Bioinf. and Comp. Biol.\u00a03(5), 1039\u20131052 (2005)","journal-title":"J. Bioinf. and Comp. Biol."},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Wooley, J.C.: Trends in computational biology: A summary based on a recomb plenary lecture. J. Comp. Biol.\u00a06(3\/4) (1999)","DOI":"10.1089\/106652799318391"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31265-6_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T22:42:43Z","timestamp":1743374563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31265-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642312649","9783642312656"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31265-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}