메뉴 건너뛰기




Volumn 30, Issue 3, 2008, Pages 188-198

An investigation into analyzing patents by chemical structure using Thomson's Derwent World Patent Index codes

Author keywords

Chemical information; Cluster analysis; Intellectual property analysis; Markush structures; Patent information

Indexed keywords


EID: 45649084075     PISSN: 01722190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.wpi.2007.10.007     Document Type: Article
Times cited : (7)

References (17)
  • 1
    • 33751392117 scopus 로고
    • Clustering of chemical structures on the basis of two-dimensional similarity measures
    • Barnard J.M., and Downs G.M. Clustering of chemical structures on the basis of two-dimensional similarity measures. J Chem Inf Comput Sci 32 (1992) 644-649
    • (1992) J Chem Inf Comput Sci , vol.32 , pp. 644-649
    • Barnard, J.M.1    Downs, G.M.2
  • 2
    • 33645265985 scopus 로고    scopus 로고
    • Clustering methods and their uses in computational chemistry
    • Lipowitz K.B., and Boyd D.B. (Eds), Wiley-VCH, John Wiley & Sons, Inc.
    • Barnard J.M., and Downs G.M. Clustering methods and their uses in computational chemistry. In: Lipowitz K.B., and Boyd D.B. (Eds). Reviews in computational chemistry vol. 18 (2002), Wiley-VCH, John Wiley & Sons, Inc. 1-40
    • (2002) Reviews in computational chemistry , vol.18 , pp. 1-40
    • Barnard, J.M.1    Downs, G.M.2
  • 3
    • 33646258711 scopus 로고    scopus 로고
    • Mining a chemical database for fragment co-occurrence: discovery of "chemical cliche's"
    • Lameijer E.-W., Kok J.N., Back T., and IJzerman A.P. Mining a chemical database for fragment co-occurrence: discovery of "chemical cliche's". J Chem Inf Model 46 (2006) 553-562
    • (2006) J Chem Inf Model , vol.46 , pp. 553-562
    • Lameijer, E.-W.1    Kok, J.N.2    Back, T.3    IJzerman, A.P.4
  • 4
    • 33645028388 scopus 로고    scopus 로고
    • A fragment-weighted key-based similarity measure for use in structural clustering and virtual screening
    • Jorgensen A.M.M., Langgard M., Gundertofte K., and Pedersen J.T. A fragment-weighted key-based similarity measure for use in structural clustering and virtual screening. QSAR Comp Sci 25 3 (2006) 221-234
    • (2006) QSAR Comp Sci , vol.25 , Issue.3 , pp. 221-234
    • Jorgensen, A.M.M.1    Langgard, M.2    Gundertofte, K.3    Pedersen, J.T.4
  • 5
    • 0000131605 scopus 로고    scopus 로고
    • Chemical fragment generation and clustering software
    • Barnard J.M., and Downs G.M. Chemical fragment generation and clustering software. J Chem Inf Comput Sci 37 (1997) 141-142
    • (1997) J Chem Inf Comput Sci , vol.37 , pp. 141-142
    • Barnard, J.M.1    Downs, G.M.2
  • 7
    • 0034351499 scopus 로고    scopus 로고
    • Use of Markush structure analysis techniques for descriptor generation and clustering of large combinatorial libraries
    • Barnard J.M., Downs G.M., von Scholley-Pfab A., and Brown R.D. Use of Markush structure analysis techniques for descriptor generation and clustering of large combinatorial libraries. J Mol Graph Modell 18 (2000) 452-463
    • (2000) J Mol Graph Modell , vol.18 , pp. 452-463
    • Barnard, J.M.1    Downs, G.M.2    von Scholley-Pfab, A.3    Brown, R.D.4
  • 8
    • 45649083247 scopus 로고    scopus 로고
    • http://www.ificlaims.com/index.html.
    • http://www.ificlaims.com/index.html.
  • 9
    • 45649084999 scopus 로고    scopus 로고
    • ©. The Thomson Corporation, all rights reserved; 2007. p. 1.
    • ©. The Thomson Corporation, all rights reserved; 2007. p. 1.
  • 10
    • 45649085724 scopus 로고    scopus 로고
    • ©Thomson Derwent all rights reserved; 2002.
    • ©Thomson Derwent all rights reserved; 2002.
  • 11
    • 45649085231 scopus 로고    scopus 로고
    • ®, CPI chemical indexing user guide, p. 12.
    • ®, CPI chemical indexing user guide, p. 12.
  • 12
    • 45649084666 scopus 로고    scopus 로고
    • ©. The Thomson Corporation, all rights reserved; 2007. p. 209.
    • ©. The Thomson Corporation, all rights reserved; 2007. p. 209.
  • 13
    • 0036663707 scopus 로고    scopus 로고
    • Maximum common subgraph isomorphism algorithms for the matching of chemical structures
    • c.f.
    • c.f. Raymond J.W., and Willett P. Maximum common subgraph isomorphism algorithms for the matching of chemical structures. J Comput-Aided Molec Des 16 7 (2002) 521-533
    • (2002) J Comput-Aided Molec Des , vol.16 , Issue.7 , pp. 521-533
    • Raymond, J.W.1    Willett, P.2
  • 14
    • 0036708522 scopus 로고    scopus 로고
    • The maximum common substructure as a molecular depiction in a supervised classification context: experiments in quantitative structure/biodegradability relationships
    • Cuissart B., Touffet F., Cremilleux B., Bureau R., and Rault S. The maximum common substructure as a molecular depiction in a supervised classification context: experiments in quantitative structure/biodegradability relationships. J Chem Inf Comput Sci 42 5 (2002) 10434-10452
    • (2002) J Chem Inf Comput Sci , vol.42 , Issue.5 , pp. 10434-10452
    • Cuissart, B.1    Touffet, F.2    Cremilleux, B.3    Bureau, R.4    Rault, S.5
  • 15
    • 20444410051 scopus 로고    scopus 로고
    • Database clustering with a combination of fingerprint and maximum common substructure methods
    • Stahl M., and Mauser H. Database clustering with a combination of fingerprint and maximum common substructure methods. J Chem Inf Model 45 (2005) 542-548
    • (2005) J Chem Inf Model , vol.45 , pp. 542-548
    • Stahl, M.1    Mauser, H.2
  • 16
    • 45649084969 scopus 로고    scopus 로고
    • John Barnard, Chemical structure representation and search systems, Lecture 5. November 13, 2003, Barnard Chemical Information Ltd., Sheffield, UK. www.indiana.edu/~cheminfo/C571/c571_Barnard6.ppt.
    • John Barnard, Chemical structure representation and search systems, Lecture 5. November 13, 2003, Barnard Chemical Information Ltd., Sheffield, UK. www.indiana.edu/~cheminfo/C571/c571_Barnard6.ppt.


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