메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 283-287

New results on DNA codes

Author keywords

[No Author keywords available]

Indexed keywords

DNA CODES; DNA HYBRIDIZATION ASSAYS; ERROR CORRECTING CODES; SIMILARITY FUNCTIONS;

EID: 33746717933     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523339     Document Type: Conference Paper
Times cited : (17)

References (14)
  • 1
    • 0000390142 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • (in Russian)
    • V. I. Levenshtein, "Binary Codes Capable of Correcting Deletions, Insertions, and Reversals", Dokl. Akad. Nauk USSR, vol. 163, pp. 845-848, 1965, (in Russian).
    • (1965) Dokl. Akad. Nauk USSR , vol.163 , pp. 845-848
    • Levenshtein, V.I.1
  • 2
    • 0001116877 scopus 로고
    • English translation
    • English translation: J. Soviet Phys.-Doklady, 10, pp. 707-710, (1966).
    • (1966) J. Soviet Phys.-doklady , vol.10 , pp. 707-710
  • 5
    • 0021489581 scopus 로고
    • Nonbinary codes, correcting single deletions or insertions
    • G.M. Tenengol'ts, "Nonbinary Codes, Correcting Single Deletions or Insertions", IEEE Trans. Inform. Theory, vol. IT-30, No 5, pp. 766-769, (1984).
    • (1984) IEEE Trans. Inform. Theory , vol.IT-30 , Issue.5 , pp. 766-769
    • Tenengol'ts, G.M.1
  • 6
    • 0028114541 scopus 로고
    • Molecular computation of solutions to combinatorial problems
    • L. Adleman, "Molecular Computation of Solutions to Combinatorial Problems", Science, vol. 266, pp. 1021-1024, (1994).
    • (1994) Science , vol.266 , pp. 1021-1024
    • Adleman, L.1
  • 8
    • 0035255506 scopus 로고    scopus 로고
    • Efficient reconstruction of sequences from their subsequences and supersequences
    • V.I. Levenshtein, "Efficient Reconstruction of Sequences from Their Subsequences and Supersequences", Journal of Combinatorial Theory, Series A, vol.93, pp. 310-332 (2001).
    • (2001) Journal of Combinatorial Theory, Series A , vol.93 , pp. 310-332
    • Levenshtein, V.I.1
  • 10
    • 33749449721 scopus 로고    scopus 로고
    • Bounds for deletion/insertion correcting codes
    • Lausanne, Switzerland, July
    • V.I. Levenshtein, "Bounds for Deletion/Insertion Correcting Codes", Proc. of ISIT-2002, Lausanne, Switzerland, July 2002.
    • (2002) Proc. of ISIT-2002
    • Levenshtein, V.I.1


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