Aligning sequences with non-Affine Gap penalty: Plains Algorithm, a Practical Implementation, and its biological Applications in Comparative genomics
暂无分享,去创建一个
Yi Zhou | Bud Mishra | Ofer H. Gill | B. Mishra | Yi Zhou | O. Gill
[1] William H. Press,et al. Numerical Recipes: The Art of Scientific Computing , 1987 .
[2] W. Pearson. Comparison of methods for searching protein sequence databases , 1995, Protein science : a publication of the Protein Society.
[3] Michael Brudno,et al. Alignment of Genomic DNA LAGAN and Multi-LAGAN : Efficient Tools for Large-Scale Multiple , 2003 .
[4] Xun Gu,et al. The size distribution of insertions and deletions in human and rodent pseudogenes suggests the logarithmic gap penalty for sequence alignment , 1995, Journal of Molecular Evolution.
[5] S. Altschul,et al. A tool for multiple sequence alignment. , 1989, Proceedings of the National Academy of Sciences of the United States of America.
[6] S. Karlin,et al. Applications and statistics for multiple high-scoring segments in molecular sequences. , 1993, Proceedings of the National Academy of Sciences of the United States of America.
[7] M. Waterman,et al. A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons. , 1987, Journal of molecular biology.
[8] Eugene W. Myers,et al. Optimal alignments in linear space , 1988, Comput. Appl. Biosci..
[9] D Graur,et al. Patterns and rates of indel evolution in processed pseudogenes from humans and murids. , 1997, Gene.
[10] Mark Gerstein,et al. Patterns of nucleotide substitution, insertion and deletion in the human genome inferred from pseudogenes. , 2003, Nucleic acids research.
[11] S. Altschul,et al. Issues in searching molecular sequence databases , 1994, Nature Genetics.
[12] E. Myers,et al. Sequence comparison with concave weighting functions. , 1988, Bulletin of mathematical biology.
[13] S. B. Needleman,et al. A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins , 1989 .
[14] S. Karlin,et al. Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. , 1990, Proceedings of the National Academy of Sciences of the United States of America.
[15] M S Waterman,et al. Identification of common molecular subsequences. , 1981, Journal of molecular biology.
[16] I. Longden,et al. EMBOSS: the European Molecular Biology Open Software Suite. , 2000, Trends in genetics : TIG.
[17] E. Myers,et al. Basic local alignment search tool. , 1990, Journal of molecular biology.
[18] S. B. Needleman,et al. A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.
[19] W. Pearson. Searching protein sequence libraries: comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms. , 1991, Genomics.
[20] E. G. Shpaer,et al. Sensitivity and selectivity in protein similarity searches: a comparison of Smith-Waterman in hardware to BLAST and FASTA. , 1996, Genomics.