메뉴 건너뛰기




Volumn 63, Issue 3, 2007, Pages 758-766

A segmentation/clustering model for the analysis of array CGH data

Author keywords

Array CGH; Dynamic programming; EM algorithm; Mixture models; Segmentation

Indexed keywords

DYNAMIC PROGRAMMING; GENES; MAXIMUM LIKELIHOOD ESTIMATION; MAXIMUM PRINCIPLE; SIGNAL PROCESSING; TRELLIS CODES;

EID: 34548414218     PISSN: 0006341X     EISSN: 15410420     Source Type: Journal    
DOI: 10.1111/j.1541-0420.2006.00729.x     Document Type: Article
Times cited : (57)

References (13)
  • 1
    • 0024541195 scopus 로고
    • Algorithms for the optimal identification of segments neighborhoods
    • Auger, I. and Lawrence, C. (1989). Algorithms for the optimal identification of segments neighborhoods. Bulletin of Mathematical Biology 51, 39 54.
    • (1989) Bulletin of Mathematical Biology , vol.51 , pp. 39-54
    • Auger, I.1    Lawrence, C.2
  • 2
    • 20144368274 scopus 로고    scopus 로고
    • High-resolution genome-wide mapping of genetic alterations in human glial brain tumors
    • and
    • Bredel, M., Bredel, C., Juric, D., Harsh, G., Vogel, H., Recht, L., and Sikic, B. (2005). High-resolution genome-wide mapping of genetic alterations in human glial brain tumors. Cancer Research 65, 4088 4096.
    • (2005) Cancer Research , vol.65 , pp. 4088-4096
    • Bredel, M.1    Bredel, C.2    Juric, D.3    Harsh, G.4    Vogel, H.5    Recht, L.6    Sikic, B.7
  • 3
    • 23444459574 scopus 로고    scopus 로고
    • Array CGH technologies and their applications to cancer genomics
    • and
    • Davies, J., Wilson, I. M., and Lam, W. (2005). Array CGH technologies and their applications to cancer genomics. Chromosome Research 13, 237 248.
    • (2005) Chromosome Research , vol.13 , pp. 237-248
    • Davies, J.1    Wilson, I.M.2    Lam, W.3
  • 7
    • 33747856481 scopus 로고    scopus 로고
    • Transcript mapping with high-density oligonucleotide tiling arrays
    • and
    • Huber, W., Toedling, J., and Steinmetz, L. (2006). Transcript mapping with high-density oligonucleotide tiling arrays. Bioinformatics 22, 1963 1973.
    • (2006) Bioinformatics , vol.22 , pp. 1963-1973
    • Huber, W.1    Toedling, J.2    Steinmetz, L.3
  • 8
    • 12344259648 scopus 로고    scopus 로고
    • Analysis of array CGH data: From signal ratio to gain and loss of DNA regions
    • and
    • Hupe, P., Stransky, N., Thiery, J., Radvanyi, F., and Barillot, E. (2004). Analysis of array CGH data: From signal ratio to gain and loss of DNA regions. Bioinformatics 20, 3413 3422.
    • (2004) Bioinformatics , vol.20 , pp. 3413-3422
    • Hupe, P.1    Stransky, N.2    Thiery, J.3    Radvanyi, F.4    Barillot, E.5
  • 9
    • 27544483495 scopus 로고    scopus 로고
    • Comparative analysis of algorithms for identifying amplifications and deletions in array CGH data
    • and
    • Lai, W., Johnson, M., Kucherlapati, R., and Park, P. J. (2005). Comparative analysis of algorithms for identifying amplifications and deletions in array CGH data. Bioinformatics 21, 3763 3770.
    • (2005) Bioinformatics , vol.21 , pp. 3763-3770
    • Lai, W.1    Johnson, M.2    Kucherlapati, R.3    Park, P.J.4
  • 10
    • 19844378139 scopus 로고    scopus 로고
    • Using penalized contrasts for the change-point problem
    • Lavielle, M. (2005). Using penalized contrasts for the change-point problem. Signal Processing 85, 1501 1510.
    • (2005) Signal Processing , vol.85 , pp. 1501-1510
    • Lavielle, M.1
  • 11
    • 3543105225 scopus 로고    scopus 로고
    • Circular binary segmentation for the analysis of array-based DNA copy number data
    • and
    • Olshen, A., Venkatraman, E., Lucito, R., and Wigler, M. (2004). Circular binary segmentation for the analysis of array-based DNA copy number data. Biostatistics 5, 557 572.
    • (2004) Biostatistics , vol.5 , pp. 557-572
    • Olshen, A.1    Venkatraman, E.2    Lucito, R.3    Wigler, M.4


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