메뉴 건너뛰기




Volumn , Issue , 2003, Pages 415-432

Solving data clustering problem as a string search problem

Author keywords

[No Author keywords available]

Indexed keywords


EID: 85013476876     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter
Times cited : (3)

References (37)
  • 1
    • 2042437650 scopus 로고    scopus 로고
    • Initial sequencing and analysis of the human genome
    • E. S. Lander et al. (2001). Initial sequencing and analysis of the human genome. Nature, 409, 860-921.
    • (2001) Nature , vol.409 , pp. 860-921
    • Lander, E.S.1
  • 2
    • 0035895505 scopus 로고    scopus 로고
    • The sequence of the human genome
    • J. C. Venter et al.(2001). The sequence of the human genome. Science, 291,1304-1351.
    • (2001) Science , vol.291 , pp. 1304-1351
    • Venter, J.C.1
  • 5
    • 0034705128 scopus 로고    scopus 로고
    • High throughput protein fold identification by using experimental constraints derived from intramolecular crosslinks and mass spectrometry
    • M. M. Young, N. Tang, J. C. Hempel, C. M. Oshiro, E. W. Taylor, I. D. Kuntz, B. W. Gibson, and G. Dollinger.(2000). High throughput protein fold identification by using experimental constraints derived from intramolecular crosslinks and mass spectrometry. Proc. Natl. Acad. Sci. USA, 97,5802-5806.
    • (2000) Proc. Natl. Acad. Sci. USA , vol.97 , pp. 5802-5806
    • Young, M.M.1    Tang, N.2    Hempel, J.C.3    Oshiro, C.M.4    Taylor, E.W.5    Kuntz, I.D.6    Gibson, B.W.7    Dollinger, G.8
  • 6
    • 0034923505 scopus 로고    scopus 로고
    • Analysis of proteins and proteomes by mass spectrometry
    • M. Mann, R. C. Hendrickson, and A. Pandey.(2001). Analysis of proteins and proteomes by mass spectrometry. Annu. Rev. Biochem., 70, 437-473.
    • (2001) Annu. Rev. Biochem. , vol.70 , pp. 437-473
    • Mann, M.1    Hendrickson, R.C.2    Pandey, A.3
  • 8
    • 0024406857 scopus 로고
    • A novel genetic system to detect proteinprotein interactions
    • S. Fields and O. K. Song.(1989). A novel genetic system to detect proteinprotein interactions. Nature, 340, 245-246.
    • (1989) Nature , vol.340 , pp. 245-246
    • Fields, S.1    Song, O.K.2
  • 10
    • 4243789724 scopus 로고    scopus 로고
    • April
    • U.S. Department of Energy. Genomes to Life program. http://DOEGenomesToLife.org/, April, 2001.
    • (2001) Genomes to Life Program
  • 11
    • 0034062083 scopus 로고    scopus 로고
    • Analysis of large-scale gene expression data
    • G. Sherlock.(2000). Analysis of large-scale gene expression data. Curr. Opin. Immunol., 12, 201-205.
    • (2000) Curr. Opin. Immunol. , vol.12 , pp. 201-205
    • Sherlock, G.1
  • 13
    • 0028961335 scopus 로고
    • Scop: A structural classification of proteins database for the investigation of sequences and structures
    • A. G. Murzin, S. E. Brenner, T. Hubbard, and C. Chothia.(1995). Scop: a structural classification of proteins database for the investigation of sequences and structures. J. Mol. Biol., 247, 536-540.
    • (1995) J. Mol. Biol. , vol.247 , pp. 536-540
    • Murzin, A.G.1    Brenner, S.E.2    Hubbard, T.3    Chothia, C.4
  • 14
    • 0027216384 scopus 로고
    • The ENZYME data bank
    • A. Bairoch.(1993). The ENZYME data bank. Nucleic Acids Research, 21, 3155-3156.
    • (1993) Nucleic Acids Research , vol.21 , pp. 3155-3156
    • Bairoch, A.1
  • 16
    • 0034491038 scopus 로고    scopus 로고
    • Protein domain decomposition using a graph-theoretic approach
    • Ying Xu, Dong Xu, and Harold N. Gabow.(2000). Protein domain decomposition using a graph-theoretic approach. Bioinformatics, 16,1091-1104.
    • (2000) Bioinformatics , vol.16 , pp. 1091-1104
    • Ying, X.1    Dong, X.2    Haroldgabow, N.3
  • 17
    • 0032919372 scopus 로고    scopus 로고
    • Recent improvements of the ProDom database of protein domain families
    • F. Corpet, J. Gouzy, and D. Kahn.(1999). Recent improvements of the ProDom database of protein domain families. Nucleic Acids Research, 27, 263-267.
    • (1999) Nucleic Acids Research , vol.27 , pp. 263-267
    • Corpet, F.1    Gouzy, J.2    Kahn, D.3
  • 18
    • 0031744176 scopus 로고    scopus 로고
    • Domain identification by clustering sequence alignments
    • X. Guan and L. Du.(1998). Domain identification by clustering sequence alignments. Bioinformatics, 14, 783-788.
    • (1998) Bioinformatics , vol.14 , pp. 783-788
    • Guan, X.1    Du, L.2
  • 20
    • 0035108235 scopus 로고    scopus 로고
    • A hierarchical unsupervised growing neural network for clustering gene expression patterns
    • J. Herrero, A. Valencia, and J. Dopazo.(2001). A hierarchical unsupervised growing neural network for clustering gene expression patterns. Bioinformatics, 17,126-136.
    • (2001) Bioinformatics , vol.17 , pp. 126-136
    • Herrero, J.1    Valencia, A.2    Dopazo, J.3
  • 22
    • 0030270953 scopus 로고    scopus 로고
    • GRAIL: A multi-agent neural network system for gene identification
    • Ying Xu, Richard J. Mural, J. R. Einstein, Manesh Shah, and E. C. Uber-bacher.(1996). GRAIL: A multi-agent neural network system for gene identification. Proc. IEEE, 84,1544-1552.
    • (1996) Proc. IEEE , vol.84 , pp. 1544-1552
    • Ying, X.1    Mural, R.J.2    Einstein, J.R.3    Shah, M.4    Uber-Bacher, E.C.5
  • 24
    • 0035755959 scopus 로고    scopus 로고
    • Minimum spanning trees for gene expression data clustering
    • S. Miyano, R. Shamir, and T. Takagi, (Eds.), Universal Academy Press, Tokyo
    • Y. Xu, V. Olman, and D. Xu.(2001). Minimum spanning trees for gene expression data clustering. In S. Miyano, R. Shamir, and T. Takagi, (Eds.), Proc. 12th Int. Conf. on Genome Informatics (GIW), 24-33. Universal Academy Press, Tokyo.
    • (2001) Proc. 12Th Int. Conf. On Genome Informatics (GIW) , pp. 24-33
    • Xu, Y.1    Olman, V.2    Xu, D.3
  • 25
    • 0035999974 scopus 로고    scopus 로고
    • Clustering gene expression data using a graph-theoretic approach: An application of minimum spanning trees
    • Ying Xu, Victor Olman, and Dong Xu.(2002). Clustering gene expression data using a graph-theoretic approach: An application of minimum spanning trees. Bioinformatics, 18, 536-545.
    • (2002) Bioinformatics , vol.18 , pp. 536-545
    • Ying, X.1    Olman, V.2    Dong, X.3
  • 28
    • 0027903056 scopus 로고
    • Computationally efficient cluster representation in molecular sequence megaclassification
    • D. J. States, N. L. Harris, and L. Hunter.(1993). Computationally efficient cluster representation in molecular sequence megaclassification. ISMB, 1,387-394.
    • (1993) ISMB , vol.1 , pp. 387-394
    • States, D.J.1    Harris, N.L.2    Hunter, L.3
  • 29
    • 0001120850 scopus 로고
    • Minimum spanning trees and single linkage analysis
    • J. C. Gower and G. J. S. Ross.(1969). Minimum spanning trees and single linkage analysis. Applied Statistics, 18,54-64.
    • (1969) Applied Statistics , vol.18 , pp. 54-64
    • Gower, J.C.1    Ross, G.J.S.2
  • 30
    • 84911584312 scopus 로고
    • Shortest connection networks and some generalizations
    • R. C. Prim.(1957). Shortest connection networks and some generalizations. Bell System Technical Journal, 36,1389-1401.
    • (1957) Bell System Technical Journal , vol.36 , pp. 1389-1401
    • Prim, R.C.1
  • 33
    • 0000133199 scopus 로고
    • Identifying protein-binding sites from unaligned DNA fragments
    • G. D. Stormo and G. W. Hartzell 3rd.(1989). Identifying protein-binding sites from unaligned DNA fragments. Proc. Natl. Acad. Sci. USA, 86,1183-1187.
    • (1989) Proc. Natl. Acad. Sci. USA , vol.86 , pp. 1183-1187
    • Stormo, G.D.1    Hartzell, G.W.2
  • 34
    • 0032826179 scopus 로고    scopus 로고
    • Identifying DNA and protein patterns with statistically significant alignments of multiple sequences
    • G. Z. Hertz and G. D. Stormo.(1999). Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics, 15, 563-577.
    • (1999) Bioinformatics , vol.15 , pp. 563-577
    • Hertz, G.Z.1    Stormo, G.D.2
  • 35
    • 0031901903 scopus 로고    scopus 로고
    • Methods and statistics for combining motif match scores
    • T. L. Bailey and M. Gribskov. Methods and statistics for combining motif match scores. J. Comput. Biol., 5:211-221,1998.
    • (1998) J. Comput. Biol. , vol.5 , pp. 211-221
    • Bailey, T.L.1    Gribskov, M.2
  • 36
    • 0023042012 scopus 로고    scopus 로고
    • Information content of binding sites on nucleotide sequences
    • T. D. Schneider, G. D. Stormo, L. Gold, and A. Ehrenfeucht.(1998). Information content of binding sites on nucleotide sequences. J. Mol. Biol., 188, 415-431.
    • (1998) J. Mol. Biol. , vol.188 , pp. 415-431
    • Schneider, T.D.1    Stormo, G.D.2    Gold, L.3    Ehrenfeucht, A.4
  • 37
    • 0025320805 scopus 로고
    • An expectation maximization (Em) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences
    • C. E. Lawrence and A. A. Reilly.(1990). An expectation maximization (em) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins: Struct. Funct. Genet., 7, 41-51.
    • (1990) Proteins: Struct. Funct. Genet. , vol.7 , pp. 41-51
    • Lawrence, C.E.1    Reilly, A.A.2


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