메뉴 건너뛰기




Volumn 5, Issue 2, 1998, Pages 197-210

Alignments without low-scoring regions

Author keywords

Dynamic programming; Sequence alignment; Smith Waterman algorithm

Indexed keywords

ALGORITHM; ARTICLE; CALCULATION; DATA BASE; GENE SEQUENCE; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL;

EID: 0031927028     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.1998.5.197     Document Type: Article
Times cited : (45)

References (13)
  • 1
    • 85038528655 scopus 로고    scopus 로고
    • Generalized affine gap costs for protein sequence alignment
    • To appear
    • Altschul, S. 1997. Generalized affine gap costs for protein sequence alignment. To appear in Proteins.
    • (1997) Proteins
    • Altschul, S.1
  • 4
    • 0026693729 scopus 로고
    • Aligning two sequences within a specified diagonal band
    • Chao, K.-M., Pearson, W., and Miller, W. 1992. Aligning two sequences within a specified diagonal band. CABIOS 8, 481-487.
    • (1992) CABIOS , vol.8 , pp. 481-487
    • Chao, K.-M.1    Pearson, W.2    Miller, W.3
  • 6
    • 0028679375 scopus 로고
    • Recent developments in linear-space alignment methods: A survey
    • Chao, K.-M., Hardison, R.C., and Miller, W. 1994. Recent developments in linear-space alignment methods: a survey. J. Comput. Biol. 1, 271-291.
    • (1994) J. Comput. Biol. , vol.1 , pp. 271-291
    • Chao, K.-M.1    Hardison, R.C.2    Miller, W.3
  • 7
    • 0030990949 scopus 로고    scopus 로고
    • A tool for aligning very similar DNA sequences
    • Chao, K.-M., Zhang, J., Ostell, J., and Miller, W. 1997. A tool for aligning very similar DNA sequences. CABIOS 13, 75-80.
    • (1997) CABIOS , vol.13 , pp. 75-80
    • Chao, K.-M.1    Zhang, J.2    Ostell, J.3    Miller, W.4
  • 8
    • 0020484488 scopus 로고
    • An improved algorithm for matching biological sequences
    • Gotoh, O. 1982. An improved algorithm for matching biological sequences. J. Mol. Biol. 162, 705-708.
    • (1982) J. Mol. Biol. , vol.162 , pp. 705-708
    • Gotoh, O.1
  • 9
    • 34250239747 scopus 로고
    • A priority queue in which initialization and queue operations take O(log log D) time
    • Johnson, D. 1982. A priority queue in which initialization and queue operations take O(log log D) time. Math. Systems Theory 15, 295-309.
    • (1982) Math. Systems Theory , vol.15 , pp. 295-309
    • Johnson, D.1
  • 10
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino acid sequences of two proteins
    • Needleman, S.B., and Wunsch, C.D. 1970. A general method applicable to the search for similarities in the amino acid sequences of two proteins. J. Mol. Biol. 48, 443-453.
    • (1970) J. Mol. Biol. , vol.48 , pp. 443-453
    • Needleman, S.B.1    Wunsch, C.D.2
  • 11
    • 0024597485 scopus 로고
    • Approximate matching of regular expressions
    • Myers, E., and Miller, W. 1989. Approximate matching of regular expressions. Bull. Math. Biol. 51, 5-37.
    • (1989) Bull. Math. Biol. , vol.51 , pp. 5-37
    • Myers, E.1    Miller, W.2
  • 12
    • 0026016139 scopus 로고
    • Fast optimal alignment
    • Spouge, J.L. 1991. Fast optimal alignment. CABIOS 7, 1-7.
    • (1991) CABIOS , vol.7 , pp. 1-7
    • Spouge, J.L.1
  • 13
    • 0030790426 scopus 로고    scopus 로고
    • Aligning a DNA sequence with a protein sequence
    • Zhang, Z., Pearson, W., and Miller, W. 1997. Aligning a DNA sequence with a protein sequence. J. Comput. Biol. 4, 339-349.
    • (1997) J. Comput. Biol. , vol.4 , pp. 339-349
    • Zhang, Z.1    Pearson, W.2    Miller, W.3


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