메뉴 건너뛰기




Volumn 24, Issue 16, 2008, Pages 1772-1778

Memory-efficient dynamic programming backtrace and pairwise local sequence alignment

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; CALCULATION; COMPUTER MEMORY; COMPUTER PROGRAM; CONFERENCE PAPER; CONTROLLED STUDY; HUMAN; INFORMATION PROCESSING; MATHEMATICAL COMPUTING; NONHUMAN; NUCLEOTIDE SEQUENCE; PRIORITY JOURNAL; PROBABILITY; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS;

EID: 49549085096     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btn308     Document Type: Conference Paper
Times cited : (10)

References (12)
  • 1
    • 0000353178 scopus 로고
    • A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains
    • Baum,L.E. et al. (1970) A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Ann. Math. Statist., 41, 164-171.
    • (1970) Ann. Math. Statist , vol.41 , pp. 164-171
    • Baum, L.E.1
  • 2
    • 0033563515 scopus 로고    scopus 로고
    • A Bayesian statistical algorithm for RNA secondary structure prediction
    • Ding,Y. and Lawrence,C.E. (1999) A Bayesian statistical algorithm for RNA secondary structure prediction. Comput. Chem., 23, 387-400.
    • (1999) Comput. Chem , vol.23 , pp. 387-400
    • Ding, Y.1    Lawrence, C.E.2
  • 4
    • 0030963555 scopus 로고    scopus 로고
    • Reduced space sequence alignment
    • Grice,J.A. et al. (1997) Reduced space sequence alignment. Comput. Appl. Biosci., 13, 45-53.
    • (1997) Comput. Appl. Biosci , vol.13 , pp. 45-53
    • Grice, J.A.1
  • 5
    • 25444496966 scopus 로고    scopus 로고
    • A linear memory algorithm for Baum-Welch training
    • Miklós,I. and Meyer,I.M. (2005) A linear memory algorithm for Baum-Welch training. BMC Bioinformatics, 6, 231.
    • (2005) BMC Bioinformatics , vol.6 , pp. 231
    • Miklós, I.1    Meyer, I.M.2
  • 6
    • 0029595355 scopus 로고
    • A reliable sequence alignment method based on probabilities of residue correspondences
    • Miyazawa,S. (1995) A reliable sequence alignment method based on probabilities of residue correspondences. Protein Eng., 8, 999-1009.
    • (1995) Protein Eng , vol.8 , pp. 999-1009
    • Miyazawa, S.1
  • 7
    • 0023984847 scopus 로고    scopus 로고
    • Optimal alignments in linear space
    • Myers,E.W. and Miller,W. (1998) Optimal alignments in linear space. Comput. Appl. Biosci., 4, 11-17.
    • (1998) Comput. Appl. Biosci , vol.4 , pp. 11-17
    • Myers, E.W.1    Miller, W.2
  • 8
    • 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., 48, 443-453.
    • (1970) J. Mol. Biol , vol.48 , pp. 443-453
    • Needleman, S.B.1    Wunsch, C.D.2
  • 9
  • 10
    • 84935113569 scopus 로고    scopus 로고
    • Viterbi,A.J. (1967) Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE T. Inform. Theory, 13, 260-269.
    • Viterbi,A.J. (1967) Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE T. Inform. Theory, 13, 260-269.
  • 12
    • 0034493160 scopus 로고    scopus 로고
    • Optimizing reduced-space sequence analysis
    • Wheeler,R. and Hughey,R. (2000) Optimizing reduced-space sequence analysis. Bioinformatics, 16, 1082-1090.
    • (2000) Bioinformatics , vol.16 , pp. 1082-1090
    • Wheeler, R.1    Hughey, R.2


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