Selecting the Right Similarity‐Scoring Matrix
暂无分享,去创建一个
[1] S. Altschul. Amino acid substitution matrices from an information theoretic perspective , 1991, Journal of Molecular Biology.
[2] William R. Pearson,et al. Empirical determination of effective gap penalties for sequence comparison , 2002, Bioinform..
[3] R. Spang,et al. Estimating amino acid substitution models: a comparison of Dayhoff's estimator, the resolvent approach and a maximum likelihood method. , 2002, Molecular biology and evolution.
[4] M S Waterman,et al. Identification of common molecular subsequences. , 1981, Journal of molecular biology.
[5] E. Myers,et al. Basic local alignment search tool. , 1990, Journal of molecular biology.
[6] S. Altschul,et al. Improved Sensitivity of Nucleic Acid Database Searches Using Application-Specific Scoring Matrices , 1991 .
[7] W. Pearson,et al. Homologous over-extension: a challenge for iterative similarity searches , 2010, Nucleic acids research.
[8] Broome,et al. Literature cited , 1924, A Guide to the Carnivores of Central America.
[9] D. Lipman,et al. Improved tools for biological sequence comparison. , 1988, Proceedings of the National Academy of Sciences of the United States of America.
[10] S. Henikoff,et al. Amino acid substitution matrices from protein blocks. , 1992, Proceedings of the National Academy of Sciences of the United States of America.
[11] G. Gonnet,et al. Exhaustive matching of the entire protein sequence database. , 1992, Science.
[12] W. Pearson. Searching protein sequence libraries: comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms. , 1991, Genomics.
[13] William R. Taylor,et al. The rapid generation of mutation data matrices from protein sequences , 1992, Comput. Appl. Biosci..