{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T18:25:08Z","timestamp":1782584708439,"version":"3.54.5"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,8,3]],"date-time":"2013-08-03T00:00:00Z","timestamp":1375488000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00521-013-1468-x","type":"journal-article","created":{"date-parts":[[2013,8,2]],"date-time":"2013-08-02T05:06:21Z","timestamp":1375419981000},"page":"77-84","source":"Crossref","is-referenced-by-count":17,"title":["Clustering based on median and closest string via rank distance with applications on DNA"],"prefix":"10.1007","volume":"24","author":[{"given":"Liviu P.","family":"Dinu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Radu Tudor","family":"Ionescu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,8,3]]},"reference":[{"key":"1468_CR1","doi-asserted-by":"crossref","unstructured":"Chimani M, Woste M, Bocker S (2011) A closer look at the closest string and closest substring problem. In: Proceedings of ALENEX, pp 13\u201324","DOI":"10.1137\/1.9781611972917.2"},{"key":"1468_CR2","doi-asserted-by":"crossref","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 (2000) Topology of strings: median string is np-complete. Theor Comput Sci 230:39\u201348","journal-title":"Theor Comput Sci"},{"issue":"2","key":"1468_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 RL (1977) Spearman footrule as a measure of disarray. J R Stat Soc Ser B (Methodological) 39(2):262\u2013268","journal-title":"J R Stat Soc Ser B (Methodological)"},{"issue":"1","key":"1468_CR4","first-page":"39","volume":"55","author":"LP Dinu","year":"2003","unstructured":"Dinu LP (2003) On the classification and aggregation of hierarchies with different constitutive elements. Fundamenta Informaticae 55(1):39\u201350","journal-title":"Fundamenta Informaticae"},{"key":"1468_CR5","doi-asserted-by":"crossref","unstructured":"Dinu A, Dinu LP (2005) On the syllabic similarities of romance languages. In: Proceedings of CICLing 3406, pp 785\u2013788","DOI":"10.1007\/978-3-540-30586-6_88"},{"issue":"6","key":"1468_CR6","doi-asserted-by":"crossref","first-page":"e37576","DOI":"10.1371\/journal.pone.0037576","volume":"7","author":"LP Dinu","year":"2012","unstructured":"Dinu LP, Ionescu RT (2012) An efficient rank based approach for closest string and closest substring. PLoS One 7(6):e37576","journal-title":"PLoS One"},{"key":"1468_CR7","doi-asserted-by":"crossref","unstructured":"Dinu LP, Ionescu RT (2012a) Clustering based on rank distance with applications on DNA. In: Proceedings of ICONIP 7667","DOI":"10.1007\/978-3-642-34500-5_85"},{"key":"1468_CR8","doi-asserted-by":"crossref","unstructured":"Dinu LP, Ionescu RT (2012b) Clustering methods based on closest string via rank distance. In: Proceedings of SYNASC, pp 207\u2013214","DOI":"10.1109\/SYNASC.2012.14"},{"issue":"1\u20133","key":"1468_CR9","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.tcs.2006.05.024","volume":"359","author":"LP Dinu","year":"2006","unstructured":"Dinu LP, Manea F (2006) An efficient approach for the rank aggregation problem. Theor Comput Sci 359(1\u20133):455\u2013461","journal-title":"Theor Comput Sci"},{"key":"1468_CR10","unstructured":"Dinu LP, Popa A (2012) On the closest string via rank distance. In: Proceedings of CPM 7354, pp 413\u2013426"},{"issue":"3","key":"1468_CR11","first-page":"361","volume":"73","author":"LP Dinu","year":"2006","unstructured":"Dinu LP, Sgarro A (2006) A low-complexity distance for DNA strings. Fundamenta Informaticae 73(3):361\u2013372","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"1468_CR12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M Frances","year":"1997","unstructured":"Frances M, Litman A (1997) On covering problems of codes. Theory Comput Syst 30(2):113\u2013119","journal-title":"Theory Comput Syst"},{"issue":"3","key":"1468_CR13","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/A:1009769707641","volume":"2","author":"Z Huang","year":"1998","unstructured":"Huang Z (1998) Extensions to the K-means algorithm for clustering large data sets with categorical values. Data Min Knowl Discov 2(3):283\u2013304","journal-title":"Data Min Knowl Discov"},{"key":"1468_CR14","doi-asserted-by":"crossref","unstructured":"Kailing K, Kriegel HP, Kroger P (2004) Density-connected subspace clustering for high-dimensional data. In Proceedings of the 4th SIAM international conference on data mining","DOI":"10.1137\/1.9781611972740.23"},{"key":"1468_CR15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1093\/bioinformatics\/15.4.265","volume":"15","author":"EV Koonin","year":"1999","unstructured":"Koonin EV (1999) The emerging paradigm and open problems in comparative genomics. Bioinformatics 15:265\u2013266","journal-title":"Bioinformatics"},{"issue":"1","key":"1468_CR16","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"KJ Lanctot","year":"2003","unstructured":"Lanctot KJ, Li M, Ma B, Wang S, Zhang L (2003) Distinguishing string selection problems. Inf Comput 185(1):41\u201355","journal-title":"Inf Comput"},{"issue":"12","key":"1468_CR17","doi-asserted-by":"crossref","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 PMB (2004) The similarity metric. IEEE Trans Inf Theory 50(12):3250\u20133264","journal-title":"IEEE Trans Inf Theory"},{"issue":"11","key":"1468_CR18","doi-asserted-by":"crossref","first-page":"2055","DOI":"10.1016\/j.patcog.2005.02.019","volume":"38","author":"AW Liew","year":"2005","unstructured":"Liew AW, Yan H, Yang M (2005) Pattern recognition techniques for the emerging field of bioinformatics: a review. Pattern Recognit 38(11):2055\u20132073","journal-title":"Pattern Recognit"},{"key":"1468_CR19","doi-asserted-by":"crossref","unstructured":"McCallum A, Nigam K, Ungar LH (2000) Efficient clustering of high-dimensional data sets with application to reference matching. In: Proceedings of ACM SIGKDD, pp 169\u2013178","DOI":"10.1145\/347090.347123"},{"key":"1468_CR20","doi-asserted-by":"crossref","unstructured":"Nicolas F, Rivals E (2003) Complexities of centre and median string 2676:315\u2013327","DOI":"10.1007\/3-540-44888-8_23"},{"issue":"2\u20134","key":"1468_CR21","first-page":"390","volume":"3","author":"F Nicolas","year":"2005","unstructured":"Nicolas F, Rivals E (2005) Hardness results for the center and median string problems under the weighted and unweighted edit distances. J Discret\u00a0Algorithms 3(2\u20134):390\u2013415","journal-title":"J Discret\u00a0Algorithms"},{"key":"1468_CR22","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF02143500","volume":"28","author":"J Palmer","year":"1988","unstructured":"Palmer J, Herbon L (1988) Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence. J Mol Evolut 28:87\u201389","journal-title":"J Mol Evolut"},{"issue":"1\u20133","key":"1468_CR23","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.tcs.2007.05.029","volume":"385","author":"YV Popov","year":"2007","unstructured":"Popov YV (2007) Multiple genome rearrangement by swaps and by element duplications. Theor Comput Sci 385(1\u20133):115\u2013126","journal-title":"Theor Comput Sci"},{"issue":"6","key":"1468_CR24","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1093\/oxfordjournals.molbev.a026379","volume":"17","author":"A Reyes","year":"2000","unstructured":"Reyes A, Gissi C, Pesole G, Catzeflis FM, Saccone C (2000) Where do rodents fit? Evidence from the complete mitochondrial genome of Sciurus vulgaris. Mol Biol Evol 17(6):979\u2013983","journal-title":"Mol Biol Evol"},{"key":"1468_CR25","doi-asserted-by":"crossref","unstructured":"Selim SZ, Ismail MA (1984) K-means-type algorithms: a generalized convergence theorem and characterization of local optimality. IEEE Trans Pattern Anal Mach Intell PAMI 6(1):81\u201387","DOI":"10.1109\/TPAMI.1984.4767478"},{"issue":"4","key":"1468_CR26","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/0196-8858(81)90046-4","volume":"2","author":"T Smith","year":"1981","unstructured":"Smith T, Waterman M (1981) Comparison of biosequences. Adv Appl Math 2(4):482\u2013489","journal-title":"Adv Appl Math"},{"key":"1468_CR27","unstructured":"States DJ, Agarwal P (1996) Compact encoding strategies for DNA sequence similarity search. In: Proceedings of the 4th international conference on intelligent systems for molecular biology, pp 211\u2013217"},{"issue":"2","key":"1468_CR28","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/235968.233324","volume":"25","author":"TZ Tian","year":"1996","unstructured":"Tian TZ, Ramakrishnan R, Livny M (1996) Birch: an efficient data clustering method for very large databases. SIGMOD Rec 25(2):103\u2013114","journal-title":"SIGMOD Rec"},{"key":"1468_CR29","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1089\/106652799318391","volume":"6","author":"JC Wooley","year":"1999","unstructured":"Wooley JC (1999) Trends in computational biology: a summary based on a recomb plenary lecture. J Comput Biol 6:459\u2013474","journal-title":"J Comput Biol"},{"key":"1468_CR30","doi-asserted-by":"crossref","unstructured":"Yin C, Zhao X, Mu S, Tian S (2013) A fast multiclass classification algorithm based on cooperative clustering. Neural Process Lett 1\u201314. doi: 10.1007\/s11063-013-9278-9","DOI":"10.1007\/s11063-013-9278-9"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-013-1468-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-013-1468-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-013-1468-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,15]],"date-time":"2024-05-15T22:44:23Z","timestamp":1715813063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-013-1468-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,3]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["1468"],"URL":"https:\/\/doi.org\/10.1007\/s00521-013-1468-x","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,3]]}}}