{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:48:00Z","timestamp":1759682880530},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T00:00:00Z","timestamp":1221264000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1007\/s10878-008-9184-7","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T10:56:00Z","timestamp":1221216960000},"page":"21-44","source":"Crossref","is-referenced-by-count":27,"title":["Generalized median graphs and applications"],"prefix":"10.1007","volume":"17","author":[{"given":"Lopamudra","family":"Mukherjee","sequence":"first","affiliation":[]},{"given":"Vikas","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Jiming","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Michael J.","family":"Zeitz","sequence":"additional","affiliation":[]},{"given":"Ronald","family":"Berezney","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,9,13]]},"reference":[{"issue":"5","key":"9184_CR1","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/34.211474","volume":"15","author":"HA Almohamad","year":"1993","unstructured":"Almohamad HA, Duffuaa SO (1993) A linear programming approach for the weighted graph matching problem. IEEE Trans Pattern Anal Mach Intell 15(5):522\u2013525","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"4","key":"9184_CR2","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","volume":"11","author":"HL Boblaender","year":"1990","unstructured":"Boblaender HL (1990) Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J Algorithms 11(4):631\u2013643","journal-title":"J Algorithms"},{"issue":"11","key":"9184_CR3","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y Boykov","year":"2001","unstructured":"Boykov Y, Veksler O, Zabih R (2001) Fast approximate energy minimization via graph cuts. IEEE Trans Pattern Anal Mach Intell 23(11):1222\u20131239","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9184_CR4","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1093\/hmg\/10.3.211","volume":"10","author":"S Boyle","year":"2001","unstructured":"Boyle S, Gilchrist S, Bridger J, Mahy NL, Ellis JA, Bickmore WA (2001) The spatial organization of human chromosomes within the nuclei of normal and emerin-mutant cells. Hum Mol Genet 10:211\u2013219","journal-title":"Hum Mol Genet"},{"key":"9184_CR5","doi-asserted-by":"crossref","unstructured":"Brandes U, Gaertler M, Wagner D (2003) Experiments on graph clustering algorithms. In: Proc european symposium on algorithms, pp 568\u2013579","DOI":"10.1007\/978-3-540-39658-1_52"},{"key":"9184_CR6","doi-asserted-by":"crossref","DOI":"10.1002\/0470073047","volume-title":"Mining graph data","author":"DJ Cook","year":"2006","unstructured":"Cook DJ, Holder LB (2006) Mining graph data. Wiley, New York, Chap 14"},{"issue":"1","key":"9184_CR7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/321556.321562","volume":"17","author":"DG Corneil","year":"1970","unstructured":"Corneil DG, Gotlieb CC (1970) An efficient algorithm for graph isomorphism. J Assoc Comput Mach 17(1):51\u201364","journal-title":"J Assoc Comput Mach"},{"key":"9184_CR8","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1038\/35066075","volume":"2","author":"T Cremer","year":"2001","unstructured":"Cremer T, Cremer C (2001) Chromosome territories, nuclear architecture and gene regulation in mamalian cells. Nat Rev Genet 2:292\u2013301","journal-title":"Nat Rev Genet"},{"issue":"2\u20133","key":"9184_CR9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1007460424845","volume":"30","author":"PW Finn","year":"1998","unstructured":"Finn PW, Muggleton S, Page D, Srinivasan A (1998) Pharmacophore discovery using the inductive logic programming system PROGOL. Mach Learn 30(2\u20133):241\u2013270","journal-title":"Mach Learn"},{"key":"9184_CR10","unstructured":"Foggia P, Sansone C, Vento M (2001) A database of graphs for isomorphism and sub-graph isomorphism benchmarking. In: Proc IAPR workshop on graph-based repr"},{"issue":"1","key":"9184_CR11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s00500-005-0464-1","volume":"10","author":"A Hlaoui","year":"2006","unstructured":"Hlaoui A, Wang S (2006) Median graph computation for graph clustering. Soft Comput 10(1):47\u201353","journal-title":"Soft Comput"},{"issue":"11","key":"9184_CR12","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1109\/34.42855","volume":"11","author":"R Horaud","year":"1989","unstructured":"Horaud R, Skordas T (1989) Stereo correspondence through feature grouping and maximal cliques. IEEE Trans Pattern Anal Mach Intell 11(11):1168\u20131180","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9184_CR13","unstructured":"IBM frequent subgraph miner (2004)"},{"key":"9184_CR14","doi-asserted-by":"crossref","unstructured":"Jiang X, Bunke H (2002) Optimal lower bound for generalized median problems in metric space. In: Proc of IAPR structural, syntactic, and statistical patt recog, pp 143\u2013152","DOI":"10.1007\/3-540-70659-3_14"},{"issue":"10","key":"9184_CR15","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1109\/34.954604","volume":"23","author":"X Jiang","year":"2001","unstructured":"Jiang X, Munger A, Bunke H (2001) On median graphs: Properties, algorithms, and applications. IEEE Trans Pattern Anal Mach Intell 23(10):1144\u20131151","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"8","key":"9184_CR16","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1109\/TPAMI.2006.152","volume":"28","author":"D Justice","year":"2006","unstructured":"Justice D, Hero A (2006) A binary linear programming formulation of the graph edit distance. IEEE Trans Pattern Anal Mach Intell 28(8):1200\u20131214","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"5","key":"9184_CR17","doi-asserted-by":"crossref","first-page":"2003","DOI":"10.1021\/ci060138m","volume":"46","author":"P Mah\u00e9","year":"2006","unstructured":"Mah\u00e9 P, Ralaivola L, Stoven V, Vert J (2006) The pharmacophore kernel for virtual screening with support vector machines. J Chem Inf Model 46(5):2003\u20132014","journal-title":"J Chem Inf Model"},{"issue":"20","key":"9184_CR18","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S Muggleton","year":"1994","unstructured":"Muggleton S, De Raedt L (1994) Inductive logic programming: Theory and methods. J Log Program 19(20):629\u2013679","journal-title":"J Log Program"},{"key":"9184_CR19","doi-asserted-by":"crossref","unstructured":"Mukherjee L, Singh V, Peng J, Xu J, Zeitz MJ, Berezney R (2007) Generalized median graphs: Theory and applications. In: Proc international conf on computer vision","DOI":"10.1109\/ICCV.2007.4408966"},{"key":"9184_CR20","doi-asserted-by":"crossref","unstructured":"Mukherjee L, Singh V, Xu J, Malyavantham KS, Berezney R (2006) On mobility analysis of functional sites from time lapse microscopic image sequences of living cell nucleus. In: Proc medical image computing and computer-assisted intervention, pp 577\u2013585","DOI":"10.1007\/11866763_71"},{"key":"9184_CR21","first-page":"1830","volume":"270","author":"R Nagele","year":"1998","unstructured":"Nagele R, Freeman T, McMorrow L, Lee H (1998a) Precise spatial positioning of chromosomes during prometaphase: Evidence for chromosomal order. Science 270:1830\u20131835","journal-title":"Science"},{"key":"9184_CR22","first-page":"525","volume":"112","author":"R Nagele","year":"1998","unstructured":"Nagele R, Freeman T, McMorrow L, Thomson Z, Kitson-Wind K, Lee H (1998b) Chromosomes exhibit preferential positioning in quiescent human cells. J Cell Biol 112:525\u2013535","journal-title":"J Cell Biol"},{"key":"9184_CR23","unstructured":"Ng RT, Han J (1994) Efficient and effective clustering methods for spatial data mining. In: Proc conf on very large data bases, pp 144\u2013155"},{"issue":"19","key":"9184_CR24","doi-asserted-by":"crossref","first-page":"1692","DOI":"10.1016\/S0960-9822(02)01166-1","volume":"12","author":"L Parada","year":"2002","unstructured":"Parada L, McQueen PG, Munson PJ, Misteli T (2002) Conservation of relative chromosome positioning in normal and cancer cells. Curr Biol 12(19):1692\u20131697","journal-title":"Curr Biol"},{"issue":"1\u20133","key":"9184_CR25","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0166-218X(96)00071-6","volume":"71","author":"CA Phillips","year":"1996","unstructured":"Phillips CA, Warnow T (1996) The asymmetric median tree: a new model for building consensus trees. Discrete Appl Math 71(1\u20133):311\u2013335","journal-title":"Discrete Appl Math"},{"issue":"8","key":"9184_CR26","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888\u2013905","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9184_CR27","doi-asserted-by":"crossref","unstructured":"Siddiqi K, Shokoufandeh A, Dickinson SJ, Zucker SW (1998) Shock graphs and shape matching. In: Proc international conf on computer vision, pp 222\u2013229","DOI":"10.1109\/ICCV.1998.710722"},{"issue":"7","key":"9184_CR28","doi-asserted-by":"crossref","first-page":"4424","DOI":"10.1073\/pnas.072618599","volume":"99","author":"H Tanabe","year":"2002","unstructured":"Tanabe H et al. (2002) Evolutionary conservation of chromosome territory arrangements in cell nuclei from higher primates. Proc Natl Acad Sci 99(7):4424\u20134429","journal-title":"Proc Natl Acad Sci"},{"key":"9184_CR29","doi-asserted-by":"crossref","unstructured":"Toda S (1999) Graph isomorphism: its complexity and algorithms. In: Proc conf on found of soft tech and theoretical computer science, p 341","DOI":"10.1007\/3-540-46691-6_27"},{"issue":"1","key":"9184_CR30","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J Assoc Comput Mach 23(1):31\u201342","journal-title":"J Assoc Comput Mach"},{"issue":"5","key":"9184_CR31","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S Umeyama","year":"1988","unstructured":"Umeyama S (1988) An eigendecomposition approach to weighted graph matching problems. IEEE Trans Pattern Anal Mach Intell 10(5):695\u2013703","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9184_CR32","unstructured":"Yan X, Han J (2002) gSpan:Graph-based substructure pattern mining. In: Proc IEEE international conference on data mining"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9184-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9184-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9184-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:13Z","timestamp":1559261893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9184-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,13]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["9184"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9184-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,13]]}}}