메뉴 건너뛰기




Volumn 4, Issue 4, 2010, Pages 395-410

Detecting duplicate biological entities using shortest path edit distance

Author keywords

Biological entity matching; Duplicate record detection; Histogram matching; Levenshtein; Shortest path edit distance; SPED; Text mining

Indexed keywords

ALGORITHM; AUTOMATED PATTERN RECOGNITION; BIOLOGY; COMPARATIVE STUDY; DATA MINING; PROCEDURES;

EID: 77954714476     PISSN: 17485673     EISSN: 17485681     Source Type: Journal    
DOI: 10.1504/IJDMB.2010.034196     Document Type: Article
Times cited : (15)

References (36)
  • 10
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • Dijkstra, E. W. (1959) 'A note on two problems in connection with graphs', Numer. Math., Vol. 1, pp. 269-271.
    • (1959) Numer. Math. , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 13
    • 84945709831 scopus 로고
    • Algorithm 97: Shortest path
    • Floyd, R. W. (1962) 'Algorithm 97: shortest path', CACM, Vol. 5, p. 345.
    • (1962) CACM , vol.5 , pp. 345
    • Floyd, R.W.1
  • 15
    • 0021518209 scopus 로고
    • Stochastic relaxation, Gibbs distribution and the Bayesian restoration of images
    • Geman, S. and Geman, D. (1984) 'Stochastic relaxation, Gibbs distribution and the Bayesian restoration of images', IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 6, No. 6, pp. 721-741.
    • (1984) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.6 , Issue.6 , pp. 721-741
    • Geman, S.1    Geman, D.2
  • 16
    • 77954708059 scopus 로고    scopus 로고
    • GenBank, Obtained through the internet, accessed 01/03/2009
    • GenBank (2009) GenBank Statistics, Obtained through the internet, http://www.ncbi.nlm.nih.gov/Genbank/genbankstats.html [accessed 01/03/2009].
    • (2009) GenBank Statistics
  • 17
    • 77954734763 scopus 로고    scopus 로고
    • GOA, European Bioinformatics Institute, Obtained through the internet, accessed 10/12/2008
    • GOA (2008) Gene Ontology Annotation - Proteomes, European Bioinformatics Institute, Obtained through the internet, http://www.ebi.ac.uk/GOA/proteomes. html [accessed 10/12/2008].
    • (2008) Gene Ontology Annotation - Proteomes
  • 18
    • 0020484488 scopus 로고
    • An improved algorithm for matching biological sequences
    • Gotoh, O. (1982) 'An improved algorithm for matching biological sequences', J. Mol. Biol., Vol. 162, pp. 705-708.
    • (1982) J. Mol. Biol. , vol.162 , pp. 705-708
    • Gotoh, O.1
  • 19
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions and reversals
    • February
    • Levenshtein, V. I. (1966) 'Binary codes capable of correcting deletions, insertions and reversals', Sov. Phys, Dokl., Vol. 10, February, pp. 707-710.
    • (1966) Sov. Phys, Dokl. , vol.10 , pp. 707-710
    • Levenshtein, V.I.1
  • 21
    • 0016494974 scopus 로고
    • An extension to string-to-string correction problem
    • Lowrance, R. and Wagner, R. (1975) 'An extension to string-to-string correction problem', Journal of ACM, Vol. 23, No. 2, pp. 177-183.
    • (1975) Journal of ACM , vol.23 , Issue.2 , pp. 177-183
    • Lowrance, R.1    Wagner, R.2
  • 22
    • 85018108837 scopus 로고    scopus 로고
    • The field matching problem: Algorithm and applications
    • Portland
    • Monge, A. E. and Elkan, C. P. (1996) 'The field matching problem: algorithm and applications', Proceedings of ACM SIGKDD, Portland, pp. 267-270.
    • (1996) Proceedings of ACM SIGKDD , pp. 267-270
    • Monge, A.E.1    Elkan, C.P.2
  • 24
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino acid sequence of two proteins
    • Needleman, S. B. and Wunsch, C. D. (1970) 'A general method applicable to the search for similarities in the amino acid sequence of two proteins', J. Mol. Biol., Vol. 48, pp. 443-453.
    • (1970) J. Mol. Biol. , vol.48 , pp. 443-453
    • Needleman, S.B.1    Wunsch, C.D.2
  • 27
    • 0030106049 scopus 로고    scopus 로고
    • Generalizing edit distance to incorporate domain information: Handwritten text recognition as a case study
    • Seni, G., Kripasundar, V. and Srihari, R. (1996) 'Generalizing edit distance to incorporate domain information: handwritten text recognition as a case study', Pattern Recognition, Vol. 29, No. 3, pp. 405-414.
    • (1996) Pattern Recognition , vol.29 , Issue.3 , pp. 405-414
    • Seni, G.1    Kripasundar, V.2    Srihari, R.3
  • 29
    • 31844432693 scopus 로고    scopus 로고
    • Learning the structure of markov logic networks
    • DOI 10.1145/1102351.1102407, ICML 2005 - Proceedings of the 22nd International Conference on Machine Learning
    • Singla, P. and Domingos, P. (2005) 'Learning the structure of markov logic networks', Proceedings of the Twenty-Second International Conference on Machine Learning, Bonn, Germany, pp. 441-448. (Pubitemid 43183364)
    • (2005) ICML 2005 - Proceedings of the 22nd International Conference on Machine Learning , pp. 441-448
    • Kok, S.1    Domingos, P.2
  • 32
  • 33
    • 34347388470 scopus 로고    scopus 로고
    • UniRef: Comprehensive and non-redundant uniprot reference clusters
    • Suzek, B. E., Huang, H., McGarvey, P., Mazumder, R. and Wu, C. H. (2007) 'UniRef: comprehensive and non-redundant uniprot reference clusters', Bioinformatics, Vol. 23, pp. 1282-1288.
    • (2007) Bioinformatics , vol.23 , pp. 1282-1288
    • Suzek, B.E.1    Huang, H.2    McGarvey, P.3    Mazumder, R.4    Wu, C.H.5


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