{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T07:10:02Z","timestamp":1746169802009,"version":"3.40.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035239"},{"type":"electronic","value":"9783319035246"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03524-6_43","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T12:35:00Z","timestamp":1386592500000},"page":"505-516","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for Rank Distance Consensus"],"prefix":"10.1007","author":[{"given":"Liviu P.","family":"Dinu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu Tudor","family":"Ionescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-03784-9_23","volume-title":"String Processing and Information Retrieval","author":"A. Amir","year":"2009","unstructured":"Amir, A., Landau, G.M., Na, J.C., Park, H., Park, K., Sim, J.S.: Consensus optimizing both distance sum and radius. In: Karlgren, J., Tarhio, J., Hyyr\u00f6, H. (eds.) SPIRE 2009. LNCS, vol.\u00a05721, pp. 234\u2013242. Springer, Heidelberg (2009)"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Chimani, M., Woste, M., Bocker, S.: A closer look at the closest string and closest substring problem. In: Proceedings of ALENEX, pp. 13\u201324 (2011)","DOI":"10.1137\/1.9781611972917.2"},{"issue":"2","key":"43_CR3","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 footrule as a measure of disarray. Journal of Royal Statistical Society. Series B (Methodological)\u00a039(2), 262\u2013268 (1977)","journal-title":"Journal of Royal Statistical Society. Series B (Methodological)"},{"issue":"1","key":"43_CR4","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. Fundamenta Informaticae\u00a055(1), 39\u201350 (2003)","journal-title":"Fundamenta Informaticae"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/978-3-642-34500-5_85","volume-title":"Neural Information Processing","author":"L.P. Dinu","year":"2012","unstructured":"Dinu, L.P., Ionescu, R.-T.: Clustering Based on Rank Distance with Applications on DNA. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds.) ICONIP 2012, Part V. LNCS, vol.\u00a07667, pp. 722\u2013729. Springer, Heidelberg (2012)"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Dinu, L.P., Ionescu, R.T.: Clustering Methods Based on Closest String via Rank Distance. In: Proceedings of SYNASC, pp. 207\u2013214 (2012)","DOI":"10.1109\/SYNASC.2012.14"},{"issue":"6","key":"43_CR7","doi-asserted-by":"publisher","first-page":"37576","DOI":"10.1371\/journal.pone.0037576","volume":"7","author":"L.P. Dinu","year":"2012","unstructured":"Dinu, L.P., Ionescu, R.T.: An efficient rank based approach for closest string and closest substring. PLoS ONE\u00a07(6), 37576 (2012)","journal-title":"PLoS ONE"},{"issue":"1-3","key":"43_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. Theoretical Computer Science\u00a0359(1-3), 455\u2013461 (2006)","journal-title":"Theoretical Computer Science"},{"key":"43_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-31265-6_33","volume-title":"Combinatorial Pattern Matching","author":"L.P. Dinu","year":"2012","unstructured":"Dinu, L.P., Popa, A.: On the closest string via rank distance. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol.\u00a07354, pp. 413\u2013426. Springer, Heidelberg (2012)"},{"issue":"3","key":"43_CR10","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. Fundamenta Informaticae\u00a073(3), 361\u2013372 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"43_CR11","unstructured":"Dinu, L.P., Sgarro, A.: Estimating Similarities in DNA Strings Using the Efficacious Rank Distance Approach, Systems and Computational Biology \u2013 Bioinformatics and Computational Modeling. InTech (2011)"},{"issue":"2","key":"43_CR12","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 of Computing Systems\u00a030(2), 113\u2013119 (1997)","journal-title":"Theory of Computing Systems"},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1093\/bioinformatics\/15.4.265","volume":"15","author":"E.V. Koonin","year":"1999","unstructured":"Koonin, E.V.: The emerging paradigm and open problems in comparative genomics. Bioinformatics\u00a015, 265\u2013266 (1999)","journal-title":"Bioinformatics"},{"key":"43_CR14","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.tcs.2012.11.018","volume":"468","author":"T. Lee","year":"2013","unstructured":"Lee, T., Na, J.C., Park, H., Park, K., Sim, J.S.: Finding consensus and optimal alignment of circular strings. Theoretical Computer Science\u00a0468, 92\u2013101 (2013)","journal-title":"Theoretical Computer Science"},{"issue":"12","key":"43_CR15","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/TIT.2004.838101","volume":"50","author":"M. Li","year":"2004","unstructured":"Li, M., Chen, X., Li, X., Ma, B., Vitanyi, P.M.B.: The similarity metric. IEEE Transactions on Information Theory\u00a050(12), 3250\u20133264 (2004)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"43_CR16","doi-asserted-by":"publisher","first-page":"2055","DOI":"10.1016\/j.patcog.2005.02.019","volume":"38","author":"A.W. Liew","year":"2005","unstructured":"Liew, A.W., Yan, H., Yang, M.: Pattern recognition techniques for the emerging field of bioinformatics: A review. Pattern recognition\u00a038(11), 2055\u20132073 (2005)","journal-title":"Pattern recognition"},{"key":"43_CR17","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)"},{"key":"43_CR18","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. Journal of Discrete Algorithms\u00a03, 390\u2013415 (2005)","journal-title":"Journal of Discrete Algorithms"},{"issue":"1-3","key":"43_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2007.05.029","volume":"385","author":"Y.V. Popov","year":"2007","unstructured":"Popov, Y.V.: Multiple genome rearrangement by swaps and by element duplications. Theoretical Computer Science\u00a0385(1-3), 115\u2013126 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"43_CR20","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1093\/oxfordjournals.molbev.a026379","volume":"17","author":"A. Reyes","year":"2000","unstructured":"Reyes, A., Gissi, C., Pesole, G., Catzeflis, F.M., Saccone, C.: Where Do Rodents Fit? Evidence from the Complete Mitochondrial Genome of Sciurus vulgaris. Molecular Biology Evolution\u00a017(6), 979\u2013983 (2000)","journal-title":"Molecular Biology Evolution"},{"key":"43_CR21","unstructured":"States, D.J., Agarwal, P.: Compact encoding strategies for dna sequence similarity search. In: Proceedings of the 4th International Conference on Intelligent Systems for Molecular Biology, pp. 211\u2013217 (1996)"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2013: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03524-6_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T03:31:12Z","timestamp":1746070272000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03524-6_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035239","9783319035246"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03524-6_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}