메뉴 건너뛰기




Volumn 116, Issue , 2005, Pages 83-88

Avoiding doubles in distributed nominative medical databases: Optimization of the needleman and wunsch algorithm

Author keywords

Alignment; Dynamic algorithm; Edit distance; End stage renal disease; Pattern matching

Indexed keywords

ALIGNMENT; DATABASE SYSTEMS; DISEASES; INFORMATION SYSTEMS; INFORMATION USE; OPTIMIZATION; PATTERN MATCHING; PUBLIC HEALTH;

EID: 84860699208     PISSN: 09269630     EISSN: 18798365     Source Type: Book Series    
DOI: None     Document Type: Conference Paper
Times cited : (5)

References (11)
  • 1
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino acid sequences of proteins
    • Needleman S, Wunsch C. A general Method Applicable to the Search for Similarities in the Amino Acid Sequences of Proteins. J. Mol. Biol. 1970:48, 443-453.
    • (1970) J. Mol. Biol , vol.48 , pp. 443-453
    • Needleman, S.1    Wunsch, C.2
  • 2
    • 0345566149 scopus 로고    scopus 로고
    • A guided tour to approximate string matching
    • Navarro G. A Guided Tour to Approximate String Matching. ACM Computing Surveys 2001: 33, 31- 88.
    • (2001) ACM Computing Surveys , vol.33 , pp. 31-88
    • Navarro, G.1
  • 4
    • 14044264004 scopus 로고    scopus 로고
    • A dynamic web application within n-tier architecture : A multi-source information system for end-stage renal disease
    • Baud R, Fieschi M, Le Beux P, Ruch P, eds., Saint Malo:IOS Press
    • Ben Saïd M, Simonet A, Guillon D, Jacquelinet C, Gaspoz F, Dufour E, Mugnier C, Jais JP, Simonet M, Landais P. A Dynamic Web Application Within N-Tier Architecture : A Multi-Source Information System for End-Stage Renal Disease. In : Baud R, Fieschi M, Le Beux P, Ruch P, eds. Proceedings of MIE2003, Saint Malo:IOS Press, 2003;pp. 95-100.
    • (2003) Proceedings of MIE2003 , pp. 95-100
    • Ben, S.M.1    Simonet, A.2    Guillon, D.3    Jacquelinet, C.4    Gaspoz, F.5    Dufour, E.6    Mugnier, C.7    Jais, J.P.8    Simonet, M.9    Landais, P.10
  • 5
    • 84886922046 scopus 로고
    • The soundex algorithm
    • Sorting and searching. Addison-Wesley Pubs. Second printing
    • The Soundex algorithm. D. Knuth. The Art of Computer Programming, vol 3. Sorting and searching. Addison-Wesley Pubs. Second printing 1975 pp 725.
    • (1975) The Art of Computer Programming , vol.3 , pp. 725
    • Knuth, D.1
  • 7
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions and reversals
    • Levenshtein V I. Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl. 1966;6:707-710.
    • (1966) Sov. Phys. Dokl , vol.6 , pp. 707-710
    • Levenshtein, V.I.1
  • 8
    • 84886923829 scopus 로고    scopus 로고
    • Approximate string comparison and its effect on an advanced record linkage system
    • Porter EH, Winkler WE. Approximate String Comparison and its Effect on an Advanced Record Linkage System. U.S. Bureau of Census. Research Reports Statistics #1997-02 (http://www.census.gov/srd/www/byyear.html).
    • Research Reports Statistics #1997-02
    • Porter, E.H.1    Winkler, W.E.2
  • 9
    • 33750719826 scopus 로고    scopus 로고
    • Approximate string comparator search strategies for very large administrative lists
    • Winkler WE, Approximate String Comparator Search Strategies for Very Large Administrative Lists. U.S. Bureau of Census. Research Reports Series Statistics #2005-02 (http://www.census.gov/srd/www/byyear.html).
    • Research Reports Series Statistics #2005-02
    • Winkler, W.E.1
  • 11
    • 84886940763 scopus 로고    scopus 로고
    • Journées francophones d'informatique médicale
    • mai
    • Paumier JP, Sauleau EA, Buemi A. Journées francophones d'informatique médicale, Lille mai 2005. (http://www.univ-lille2.fr/ jfim2005/papiers/05-paumier-jfim2005.pdf).
    • (2005) Lille
    • Paumier, J.P.1    Sauleau, E.A.2    Buemi, A.3


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