Generalized median graphs and applications

Journal of Combinatorial Optimization

Volumn 17, Issue 1, 2009, Pages 21-44

  Mukherjee, Lopamudra ^a   Singh, Vikas ^b   Peng, Jiming ^c   Xu, Jinhui ^d   Zeitz, Michael J ^e   Berezney, Ronald ^e  

^a UNIVERSITY OF WISCONSIN WHITEWATER   (United States)

^b UNIVERSITY OF WISCONSIN SCHOOL OF MEDICINE AND PUBLIC HEALTH   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^d State University of New York   (United States)

^e UNIVERSITY AT BUFFALO   (United States)

Author keywords

Cell nucleus imaging; Chromosome organization; Graph edit distance; Graph matching; Median graph; Prototype building

Indexed keywords

APPLICATIONS; BUILDINGS; EVOLUTIONARY ALGORITHMS; IMAGE ANALYSIS; LINEARIZATION; OBJECT RECOGNITION; PATTERN MATCHING; PATTERN RECOGNITION; POLYNOMIAL APPROXIMATION;

ANALYSIS PROBLEMS; BIOLOGICAL IMAGING; BIOMEDICAL PROBLEMS; EVOLUTIONARY SEARCHES; EXPERIMENTAL EVALUATIONS; GRAPH DATABASES; GRAPH EDIT DISTANCE; GRAPH MATCHING; GRAPH STRUCTURES; HE METHODS; HUMAN CHROMOSOMES; INPUT SETS; LEARNING PROBLEMS; LINEAR PROGRAMMING FORMULATIONS; MEDIAN GRAPH; MOLECULAR IMAGES; OF GRAPHS; POLYNOMIAL TIMES; PROTOTYPE BUILDING; TOPOLOGICAL MAPS; VERTEX LABELS; WORST CASES;

CHROMOSOMES;

EID: 57849126645     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-008-9184-7     Document Type: Article

References (32)

1. HA Almohamad SO Duffuaa 1993 A linear programming approach for the weighted graph matching problem IEEE Trans Pattern Anal Mach Intell 15 5 522 525
2. HL Boblaender 1990 Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees J Algorithms 11 4 631 643
3. Y Boykov O Veksler R Zabih 2001 Fast approximate energy minimization via graph cuts IEEE Trans Pattern Anal Mach Intell 23 11 1222 1239
4. S Boyle S Gilchrist J Bridger NL Mahy JA Ellis WA Bickmore 2001 The spatial organization of human chromosomes within the nuclei of normal and emerin-mutant cells Hum Mol Genet 10 211 219
5. Brandes U, Gaertler M, Wagner D (2003) Experiments on graph clustering algorithms. In: Proc european symposium on algorithms, pp 568-579
6. Cook DJ, Holder LB (2006) Mining graph data. Wiley, New York, Chap 14
7. DG Corneil CC Gotlieb 1970 An efficient algorithm for graph isomorphism J Assoc Comput Mach 17 1 51 64
8. T Cremer C Cremer 2001 Chromosome territories, nuclear architecture and gene regulation in mamalian cells Nat Rev Genet 2 292 301
9. PW Finn S Muggleton D Page A Srinivasan 1998 Pharmacophore discovery using the inductive logic programming system PROGOL Mach Learn 30 2-3 241 270
10. 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
11. A Hlaoui S Wang 2006 Median graph computation for graph clustering Soft Comput 10 1 47 53
12. R Horaud T Skordas 1989 Stereo correspondence through feature grouping and maximal cliques IEEE Trans Pattern Anal Mach Intell 11 11 1168 1180
13. IBM frequent subgraph miner (2004)
14. 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-152
15. X Jiang A Munger H Bunke 2001 On median graphs: Properties, algorithms, and applications IEEE Trans Pattern Anal Mach Intell 23 10 1144 1151
16. D Justice A Hero 2006 A binary linear programming formulation of the graph edit distance IEEE Trans Pattern Anal Mach Intell 28 8 1200 1214
17. P Mahé L Ralaivola V Stoven J Vert 2006 The pharmacophore kernel for virtual screening with support vector machines J Chem Inf Model 46 5 2003 2014
18. S Muggleton L De Raedt 1994 Inductive logic programming: Theory and methods J Log Program 19 20 629 679
19. 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
20. 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-585
21. R Nagele T Freeman L McMorrow H Lee 1998 Precise spatial positioning of chromosomes during prometaphase: Evidence for chromosomal order Science 270 1830 1835
22. R Nagele T Freeman L McMorrow Z Thomson K Kitson-Wind H Lee 1998 Chromosomes exhibit preferential positioning in quiescent human cells J Cell Biol 112 525 535
23. Ng RT, Han J (1994) Efficient and effective clustering methods for spatial data mining. In: Proc conf on very large data bases, pp 144-155
24. L Parada PG McQueen PJ Munson T Misteli 2002 Conservation of relative chromosome positioning in normal and cancer cells Curr Biol 12 19 1692 1697
25. CA Phillips T Warnow 1996 The asymmetric median tree: a new model for building consensus trees Discrete Appl Math 71 1-3 311 335
26. J Shi J Malik 2000 Normalized cuts and image segmentation IEEE Trans Pattern Anal Mach Intell 22 8 888 905
27. Siddiqi K, Shokoufandeh A, Dickinson SJ, Zucker SW (1998) Shock graphs and shape matching. In: Proc international conf on computer vision, pp 222-229
28. H Tanabe 2002 Evolutionary conservation of chromosome territory arrangements in cell nuclei from higher primates Proc Natl Acad Sci 99 7 4424 4429
29. Toda S (1999) Graph isomorphism: its complexity and algorithms. In: Proc conf on found of soft tech and theoretical computer science, p 341
30. JR Ullmann 1976 An algorithm for subgraph isomorphism J Assoc Comput Mach 23 1 31 42
31. S Umeyama 1988 An eigendecomposition approach to weighted graph matching problems IEEE Trans Pattern Anal Mach Intell 10 5 695 703
32. Yan X, Han J (2002) gSpan:Graph-based substructure pattern mining. In: Proc IEEE international conference on data mining