메뉴 건너뛰기




Volumn , Issue , 2003, Pages 375-382

An assessment of a metric space database index to support sequence homology

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; DATABASE SYSTEMS; DIGITAL STORAGE; INFORMATION MANAGEMENT; SET THEORY; TOPOLOGY;

EID: 84942563927     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIBE.2003.1188976     Document Type: Conference Paper
Times cited : (8)

References (31)
  • 1
    • 0031043056 scopus 로고    scopus 로고
    • A new method for analyzing protein sequence relationships based on Sammon maps
    • D. K. Agrafiotis, . A new method for analyzing protein sequence relationships based on Sammon maps. Protein Sci.1997, Vol.6, 287-293 .
    • (1997) Protein Sci , vol.6 , pp. 287-293
    • Agrafiotis, D.K.1
  • 3
    • 0031162001 scopus 로고    scopus 로고
    • Distance-based indexing for high dimensional metric spaces
    • ACM
    • T. Bozkaya and M. Ozsoyoglu. Distance-based indexing for high dimensional metric spaces. In Proceedings of the 1997 ACM SIGMOD, pages 357-368. ACM, 1997.
    • (1997) Proceedings of the 1997 ACM SIGMOD , pp. 357-368
    • Bozkaya, T.1    Ozsoyoglu, M.2
  • 4
    • 0002162263 scopus 로고
    • Near neighbor search in large metric spaces
    • S. Brin. Near neighbor search in large metric spaces. In Proc. VLDB'95, pages 574-584, 1995.
    • (1995) Proc. VLDB'95 , pp. 574-584
    • Brin, S.1
  • 5
    • 0015531930 scopus 로고
    • Some approaches to best match file searching
    • April
    • W. A. Burkhard and R. M. Keller. Some approaches to best match file searching. Communications ACM, 16(4):230-236, April 1973.
    • (1973) Communications ACM , vol.16 , Issue.4 , pp. 230-236
    • Burkhard, W.A.1    Keller, R.M.2
  • 6
    • 0027929096 scopus 로고
    • Computational geometry: A retrospective
    • B. Chazelle. Computational geometry: a retrospective. In Proc. ACM STOC'94, pages 75-94, 1994.
    • (1994) Proc. ACM STOC'94 , pp. 75-94
    • Chazelle, B.1
  • 10
    • 84993661659 scopus 로고    scopus 로고
    • M-tree: An efficient access method for similarity search in metric spaces
    • P. Ciaccia, M. Patella, and P. Zezula, M-Tree: An Efficient Access Method for Similarity Search in Metric Spaces. Proc. VLDB, 1997.
    • (1997) Proc. VLDB
    • Ciaccia, P.1    Patella, M.2    Zezula, P.3
  • 14
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • A. Guttman. R-trees: A Dynamic Index Struc- ture for Spatial Searching. Proc. of SIGMOD, 1984.
    • (1984) Proc. of SIGMOD
    • Guttman, A.1
  • 15
    • 0036306157 scopus 로고    scopus 로고
    • SST: An algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size
    • E. Giladi, M. G. Walker, J. Z. Wang, and W. Volkmuth SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size Bioinformatics 2002 18: 873-877.
    • (2002) Bioinformatics , vol.18 , pp. 873-877
    • Giladi, E.1    Walker, M.G.2    Wang, J.Z.3    Volkmuth, W.4
  • 16
    • 0026327996 scopus 로고
    • A quantitative measure of error minimization in the genetic code
    • D.Haig and L.Hurst. A quantitative measure of error minimization in the genetic code. J. Mol. Evol., 33:412-417, 1991
    • (1991) J. Mol. Evol. , vol.33 , pp. 412-417
    • Haig, D.1    Hurst, L.2
  • 22
    • 0031547967 scopus 로고    scopus 로고
    • Global self organization of all known protein sequences reveals inherent biological signatures
    • M. Linial, N. Linial, N. Tishby and G. Yona, Global self organization of all known protein sequences reveals inherent biological signatures, J. Molecular Biology 268 (1997) 539 -556.
    • (1997) J. Molecular Biology , vol.268 , pp. 539-556
    • Linial, M.1    Linial, N.2    Tishby, N.3    Yona, G.4
  • 23
    • 84942658797 scopus 로고    scopus 로고
    • M-tree project home page. http://wwwdb.deis.unibo.it/Mtree/index.html
  • 24
    • 0028516571 scopus 로고
    • A sublinear algorithm for approximate keyword searching
    • E.Myers, A sublinear algorithm for approximate keyword searching. Algorithmica, 1994, Vol. 12(4/5):345-374.
    • (1994) Algorithmica , vol.12 , Issue.4-5 , pp. 345-374
    • Myers, E.1
  • 25
    • 0036677029 scopus 로고    scopus 로고
    • Predicting protein cellular localisation using a domain projection method
    • R Mott, J Schultz, P. Bork , CP Ponting . Predicting Protein Cellular Localisation Using a Domain Projection Method. Genome Res (2002), 12, 1168-74
    • (2002) Genome Res , vol.12 , pp. 1168-1174
    • Mott, R.1    Schultz, J.2    Bork, P.3    Ponting, C.P.4
  • 26
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino acid sequence of two proteins
    • S.B.Needleman and C.D.Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48:443-453,1970.
    • (1970) Journal of Molecular Biology , vol.48 , pp. 443-453
    • Needleman, S.B.1    Wunsch, C.D.2
  • 30
    • 0026256261 scopus 로고
    • Satisfying general proximity/similarity queries with metric trees
    • November 25
    • J. K. Uhlmann. Satisfying General Proximity/Similarity Queries with Metric Trees. Information Processing Letter, 40(4):175-179, November 25, 1991.
    • (1991) Information Processing Letter , vol.40 , Issue.4 , pp. 175-179
    • Uhlmann, J.K.1
  • 31
    • 84942658799 scopus 로고    scopus 로고
    • Yeast data file web page
    • Yeast data file web page.


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