메뉴 건너뛰기




Volumn 410, Issue 24-25, 2009, Pages 2365-2376

On the similarity metric and the distance metric

Author keywords

Distance metric; Normalized distance metric; Normalized similarity metric; Similarity metric

Indexed keywords

DISSIMILARITY MEASURES; DISTANCE METRIC; FORMAL DEFINITIONS; GENERAL SOLUTIONS; NORMALIZED DISTANCE METRIC; NORMALIZED SIMILARITY METRIC; RESEARCH AREAS; SIMILARITY MEASURES; SIMILARITY METRIC;

EID: 67349144761     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.02.023     Document Type: Article
Times cited : (112)

References (28)
  • 1
    • 0035021688 scopus 로고    scopus 로고
    • A new approach to sequence alignment: Normalized sequence alignment
    • Arslan A.N., Eǧecioǧlu O., and Pevzner P.A. A new approach to sequence alignment: Normalized sequence alignment. Bioinformatics 17 4 (2001) 327-337
    • (2001) Bioinformatics , vol.17 , Issue.4 , pp. 327-337
    • Arslan, A.N.1    Eǧecioǧlu, O.2    Pevzner, P.A.3
  • 2
    • 0032024433 scopus 로고    scopus 로고
    • A graph distance metric based on the maximal common subgraph
    • Bunke H., and Shearer K. A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters 19 (1998) 255-259
    • (1998) Pattern Recognition Letters , vol.19 , pp. 255-259
    • Bunke, H.1    Shearer, K.2
  • 4
    • 49049084842 scopus 로고    scopus 로고
    • S. Chen, B. Ma, K. Zhang, The normalized similarity metric and its applications, in: Proceedings of 2007 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2007, 2007, pp. 172-180
    • S. Chen, B. Ma, K. Zhang, The normalized similarity metric and its applications, in: Proceedings of 2007 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2007, 2007, pp. 172-180
  • 9
    • 0001837838 scopus 로고
    • An informational measure of correlation
    • Linfoot E.H. An informational measure of correlation. Information and Control 1 1 (1957) 85-89
    • (1957) Information and Control , vol.1 , Issue.1 , pp. 85-89
    • Linfoot, E.H.1
  • 12
    • 0022864839 scopus 로고
    • Statistical treatment of the information content of a database
    • Malvestuto F.M. Statistical treatment of the information content of a database. Information Systems 11 (1986) 211-223
    • (1986) Information Systems , vol.11 , pp. 211-223
    • Malvestuto, F.M.1
  • 14
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino-acid sequences of two proteins
    • Needleman S.E., and Wunsch C.D. A general method applicable to the search for similarities in the amino-acid sequences of two proteins. Journal of Molecular Biology 48 (1970) 443-453
    • (1970) Journal of Molecular Biology , vol.48 , pp. 443-453
    • Needleman, S.E.1    Wunsch, C.D.2
  • 16
    • 33744584654 scopus 로고
    • Induction of decision trees
    • Quinlan J.R. Induction of decision trees. Machine Learning 1 1 (1986) 81-106
    • (1986) Machine Learning , vol.1 , Issue.1 , pp. 81-106
    • Quinlan, J.R.1
  • 17
    • 0040484429 scopus 로고
    • A metric space of discrete probability distributions
    • Rajski C. A metric space of discrete probability distributions. Information and Control 4 4 (1961) 371-377
    • (1961) Information and Control , vol.4 , Issue.4 , pp. 371-377
    • Rajski, C.1
  • 19
    • 0023375195 scopus 로고
    • The neighbor-joining method: A new method for reconstructing phylogenetic trees
    • Saitou N., and Nei M. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution 4 (1987) 406-425
    • (1987) Molecular Biology and Evolution , vol.4 , pp. 406-425
    • Saitou, N.1    Nei, M.2
  • 23
    • 0024114801 scopus 로고
    • A note on the neighbor-joining algorithm of Saitou and Nei
    • Studier J.A., and Keppler K.J. A note on the neighbor-joining algorithm of Saitou and Nei. Molecular Biology and Evolution 5 (1988) 729-731
    • (1988) Molecular Biology and Evolution , vol.5 , pp. 729-731
    • Studier, J.A.1    Keppler, K.J.2
  • 28
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • Zhang K., and Shasha D. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing 18 6 (1989) 1245-1262
    • (1989) SIAM Journal on Computing , vol.18 , Issue.6 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2


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