메뉴 건너뛰기




Volumn 2089, Issue , 2001, Pages 118-130

Tandem cyclic alignment

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84956985076     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48194-x_10     Document Type: Conference Paper
Times cited : (8)

References (9)
  • 1
    • 0025508207 scopus 로고
    • Efficient parallel algorithms for string editing and related problems
    • A. Apostolico, M.J. Atallah, L.L. Larmore, and S. Mc Faddin. Efficient parallel algorithms for string editing and related problems. SIAM J. Comput., 19:968-988, 1990.
    • (1990) SIAM J. Comput , vol.19 , pp. 968-988
    • Apostolico, A.1    Atallah, M.J.2    Larmore, L.L.3    Mc Faddin, S.4
  • 2
    • 0033555906 scopus 로고    scopus 로고
    • Tandem repeats finder: A program to analyze DNA sequences
    • G. Benson. Tandem repeats finder: a program to analyze DNA sequences. Nucleic Acids Research, 27:573-580, 1999.
    • (1999) Nucleic Acids Research , vol.27 , pp. 573-580
    • Benson, G.1
  • 3
    • 84968775984 scopus 로고
    • Identifying periodic occurrences of a template with applications to a protein structure
    • A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Lecture Notes in Computer Science, Springer-Verlag
    • V. Fischetti, G. Landau, J. Schmidt, and P. Sellers. Identifying periodic occurrences of a template with applications to a protein structure. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Proc. 3rd annual Symp. On Combinatorial Pattern Matching, Lecture Notes in Computer Science, volume 644, pages 111-120. Springer-Verlag, 1992.
    • (1992) Proc. 3Rd Annual Symp on Combinatorial Pattern Matching , vol.644 , pp. 111-120
    • Fischetti, V.1    Landau, G.2    Schmidt, J.3    Sellers, P.4
  • 4
    • 0017547615 scopus 로고
    • Optimal surface reconstruction from planar contours
    • H. Fuchs, Z. Kedem, and S. Uselton. Optimal surface reconstruction from planar contours. CACM, 20:693-702, 1977.
    • (1977) CACM , vol.20 , pp. 693-702
    • Fuchs, H.1    Kedem, Z.2    Uselton, S.3
  • 6
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions and reversals
    • V.I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Phys. Dokl., 10:707-710, 1966.
    • (1966) Soviet Phys. Dokl , vol.10 , pp. 707-710
    • Levenshtein, V.I.1
  • 7
    • 0025437146 scopus 로고
    • On a cyclic string-to-string correction problem
    • M. Maes. On a cyclic string-to-string correction problem. Information Processing Letters, 35:73-78, 1990.
    • (1990) Information Processing Letters , vol.35 , pp. 73-78
    • Maes, M.1
  • 9
    • 0001596047 scopus 로고    scopus 로고
    • All shortest paths in weighted grid graphs and its application to finding all aproximate repeats in strings
    • J. Schmidt. All shortest paths in weighted grid graphs and its application to finding all aproximate repeats in strings. SIAM J. Comput., 27:972-992, 1998.
    • (1998) SIAM J. Comput , vol.27 , pp. 972-992
    • Schmidt, J.1


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