메뉴 건너뛰기




Volumn 209, Issue 2, 2007, Pages 514-527

Mathematical modeling of the malignancy of cancer using graph evolution

Author keywords

Glioma; Graph evolution; Graph theory; Histopathological image analysis; Mathematical cancer grading; Mathematical modeling of cancer malignancy

Indexed keywords

BRAIN; COMPUTATIONAL METHODS; GRAPH THEORY; HISTOLOGY; IMAGE ANALYSIS; MATHEMATICAL MODELS; PROBABILITY;

EID: 34548580545     PISSN: 00255564     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mbs.2007.03.005     Document Type: Article
Times cited : (22)

References (30)
  • 1
    • 11244340239 scopus 로고    scopus 로고
    • Collective dynamics of small-world networks
    • Watts D., and Strogatz S. Collective dynamics of small-world networks. Nature 363 (1998) 202
    • (1998) Nature , vol.363 , pp. 202
    • Watts, D.1    Strogatz, S.2
  • 2
    • 0033204106 scopus 로고    scopus 로고
    • M. Faloutsos, P. Faloutsos, C. Faloutsos, On power-law relationships of the Internet topology, in: Proceedings of ACM/SIGCOMM, Cambridge, Massachusetts, 1999, p. 251.
  • 3
    • 0033539175 scopus 로고    scopus 로고
    • Diameter of the World Wide Web
    • Albert R., Jeong H., and Barabasi A.-L. Diameter of the World Wide Web. Nature 401 (1999) 130
    • (1999) Nature , vol.401 , pp. 130
    • Albert, R.1    Jeong, H.2    Barabasi, A.-L.3
  • 4
    • 34548568540 scopus 로고    scopus 로고
    • A. Broder, R. Kumar, F. Maghoul, P. Raghavan, R. Stata, Graph structure in the Web, in: Proceedings of the ninth International World Wide Web Conference, Amsterdam, The Netherlands, 2000, pp. 247.
  • 5
    • 0000116106 scopus 로고    scopus 로고
    • Who is the best connected scientist? A study of scientific coauthorship networks
    • cond-mat/0011144
    • Newman M.E.J. Who is the best connected scientist? A study of scientific coauthorship networks. Phys. Rev. E64 (2001) cond-mat/0011144
    • (2001) Phys. Rev. , vol.E64
    • Newman, M.E.J.1
  • 8
    • 0002687371 scopus 로고
    • The small-world problem
    • Milgram S. The small-world problem. Psychol. Today 2 (1967) 61
    • (1967) Psychol. Today , vol.2 , pp. 61
    • Milgram, S.1
  • 12
    • 0035823264 scopus 로고    scopus 로고
    • The small world inside large metabolic networks
    • Wagner A., and Fell D. The small world inside large metabolic networks. P. Roy. Soc. Lond. B Bio. 268 (2001) 1803
    • (2001) P. Roy. Soc. Lond. B Bio. , vol.268 , pp. 1803
    • Wagner, A.1    Fell, D.2
  • 13
    • 24344444969 scopus 로고    scopus 로고
    • The architecture of biological networks
    • Deisboeck T.S., Yasha Kresh J., and Kepler T.B. (Eds), Kluwer Academic Publishing, New York
    • Wuchty S., Ravasz E., and Barabasi A.-L. The architecture of biological networks. In: Deisboeck T.S., Yasha Kresh J., and Kepler T.B. (Eds). Complex Systems in Biomedicine (2003), Kluwer Academic Publishing, New York
    • (2003) Complex Systems in Biomedicine
    • Wuchty, S.1    Ravasz, E.2    Barabasi, A.-L.3
  • 16
    • 27544469752 scopus 로고    scopus 로고
    • Augmented cell-graphs for automated cancer diagnosis
    • Demir C., Gultekin S.H., and Yener B. Augmented cell-graphs for automated cancer diagnosis. Bioinformatics 21 (2005) ii7
    • (2005) Bioinformatics , vol.21
    • Demir, C.1    Gultekin, S.H.2    Yener, B.3
  • 19
    • 0018306059 scopus 로고
    • A threshold selection method from gray level histograms
    • Otsu N. A threshold selection method from gray level histograms. IEEE Trans. Syst. Man Cyb. 9 (1979) 62
    • (1979) IEEE Trans. Syst. Man Cyb. , vol.9 , pp. 62
    • Otsu, N.1
  • 21
    • 0026172104 scopus 로고
    • Watersheds in digital spaces: an efficient algorithm based on immersion simulations
    • Vincent L., and Soille P. Watersheds in digital spaces: an efficient algorithm based on immersion simulations. IEEE Trans. Pattern Anal. 13 (1991) 583
    • (1991) IEEE Trans. Pattern Anal. , vol.13 , pp. 583
    • Vincent, L.1    Soille, P.2
  • 23
    • 0000207615 scopus 로고
    • On the strength of connectedness of a random graph
    • Erdos P., and Renyi A. On the strength of connectedness of a random graph. Acta Mathematica Scientia Hungary 12 (1961) 261
    • (1961) Acta Mathematica Scientia Hungary , vol.12 , pp. 261
    • Erdos, P.1    Renyi, A.2
  • 24
    • 34548555276 scopus 로고    scopus 로고
    • M. Karonski, A. Rucinski, The origins of the theory of random graphs, Mathematics of Paul Erdos; Graham, 1997, p. 311.
  • 27
    • 0030975761 scopus 로고    scopus 로고
    • Automated location of dysplastic fields in colorectal histology using image texture analysis
    • Hamilton P.W., Bartels P.H., Thompson D., Anderson N.H., and Montironi R. Automated location of dysplastic fields in colorectal histology using image texture analysis. J. Pathol. 182 (1997) 68
    • (1997) J. Pathol. , vol.182 , pp. 68
    • Hamilton, P.W.1    Bartels, P.H.2    Thompson, D.3    Anderson, N.H.4    Montironi, R.5
  • 28
    • 0032148242 scopus 로고    scopus 로고
    • Microscopic image analysis for quantitative measurement and feature identification of normal and cancerous colonic mucosa
    • Esgiar A.N., Naguib R.N.G., Sharif B.S., Bennett M.K., and Murray A. Microscopic image analysis for quantitative measurement and feature identification of normal and cancerous colonic mucosa. IEEE Trans. Inform. Technol. Biomed. 2 (1998) 197
    • (1998) IEEE Trans. Inform. Technol. Biomed. , vol.2 , pp. 197
    • Esgiar, A.N.1    Naguib, R.N.G.2    Sharif, B.S.3    Bennett, M.K.4    Murray, A.5
  • 30
    • 0018466704 scopus 로고
    • Statistical and structural approaches to texture
    • Haralick R.M. Statistical and structural approaches to texture. P. IEEE 67 (1979) 786
    • (1979) P. IEEE , vol.67 , pp. 786
    • Haralick, R.M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.