Generalized median graphs: Theory and applications

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2007, Pages

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

^a State University of New York   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATIONS; ARTIFICIAL INTELLIGENCE; CHROMOSOMES; COMPUTATIONAL GEOMETRY; COMPUTER NETWORKS; COMPUTER VISION; EVOLUTIONARY ALGORITHMS; IMAGE ANALYSIS; IMAGE PROCESSING; LINEAR PROGRAMMING; LINEARIZATION; OBJECT RECOGNITION; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

INTERNATIONAL CONFERENCES; MEDIAN GRAPHS;

PROBLEM SOLVING;

EID: 50649094196     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2007.4408966     Document Type: Conference Paper

References (18)

1. IBM Frequent Subgraph Miner (http://www.alphaworks.ibm.com/tech/fsm).
2. H. A. Almohamad and S. O. Duffuaa. A linear programming approach for the weighted graph matching problem. IEEE PAMI, 15(5):522-525, 1993.
3. S. Boyle, S. Gilchrist, J. Bridger, N. L. Mahy, J. A. Ellis, and W. A. Bickmore. The spatial organization of human chromosomes within the nuclei of normal and emerin-mutant cells. Hum. Mol. Genet., 10:211-219, 2001.
4. D. G. Corneil and C. C. Gotlieb. An e cient algorithm for graph isomorphism. J. ACM, 17(1):51-64, 1970.
5. T. Cremer and C. Cremer. Chromosome territories, nuclear architecture and gene regulation in mamalian cells. Nature Reviews Genetics, 2:292-301, 2001.
6. P. W. Finn, S. Muggleton, D. Page, and A. Srinivasan. Pharmacophore discovery using the inductive logic programming system PROGOL. Machine Learning, 30(2-3):241-270, 1998.
7. H. Tanabe et al. Evolutionary conservation of chromosome territory arrangements in cell nuclei from higher primates. PNAS, 99(7):4424-4429, 2002.
8. A. Hlaoui and S. Wang. Median graph computation for graph clustering. Soft Comp., 10(1):47-53, 2006.
9. X. Jiang and H. Bunke. Optimal lower bound for generalized median problems in metric space. In Proc. IAPR SSSPR, pages 143-152, 2002.
10. X. Jiang, A. Munger, and H. Bunke. On median graphs: Properties, algorithms, and applications. IEEE PAMI, 23(10):1144-1151, 2001.
11. D. Justice and A. Hero. A binary linear programming formulation of the graph edit distance. IEEE PAMI, 28(8):1200-1214, 2006.
12. L. Mukherjee, V. Singh, J. Xu, K. Malyavantham, and R. Berezney. On mobility analysis of functional sites from time lapse microscopic image sequences of living cell nucleus. In MICCAI, pages 577-585, 2006.
13. R. Nagele, T. Freeman, L. McMorrow, and H. Lee. Precise spatial positioning of chromosomes during prometaphase: Evidence for chromosomal order. Science, 270:1830-1835, 1998.
14. L. Parada, P. G. McQueen, P. J. Munson, and T. Misteli. Conservation of relative chromosome positioning in normal and cancer cells. Curr. Biol., 12(19):1692-1697, 2002.
15. C. A. Phillips and T. Warnow. The Asymmetric Median Tree: A New Model for Building Consensus Trees. Discrete Appl. Math., 71(1-3):311-335, 1996.
16. S. Toda. Graph Isomorphism: Its Complexity and Algorithms. In Proc. FSTTCS, page 341, 1999.
17. J. R. Ullmann. An algorithm for subgraph isomorphism. J. ACM, 23(1):31-42, 1976.
18. S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE PAMI, 10(5):695-703, 1988.