The Maximum Weight Trace Problem in Multiple Sequence Alignment
暂无分享,去创建一个
[1] A. K. Wong,et al. A survey of multiple sequence comparison methods. , 1992, Bulletin of mathematical biology.
[2] M S Waterman,et al. Consensus methods for DNA and protein sequence alignment. , 1990, Methods in enzymology.
[3] D. Gusfield. Efficient methods for multiple sequence alignment with guaranteed error bounds , 1993 .
[4] P. Pevzner. Multiple alignment, communication cost, and graph matching , 1992 .
[5] J. Kececioglu. Exact and approximation algorithms for DNA sequence reconstruction , 1992 .
[6] M. W. Du,et al. Computing a longest common subsequence for a set of strings , 1984, BIT.
[7] D. Sankoff. Minimal Mutation Trees of Sequences , 1975 .
[8] O. Gotoh. Consistency of optimal sequence alignments. , 1990, Bulletin of Mathematical Biology.
[9] David Sankoff,et al. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[12] D. Lipman,et al. The multiple sequence alignment problem in biology , 1988 .
[13] Martin Vingron,et al. A fast and sensitive multiple sequence alignment algorithm , 1989, Comput. Appl. Biosci..
[14] M S Waterman,et al. Identification of common molecular subsequences. , 1981, Journal of molecular biology.
[15] Robert W. Irving,et al. Two Algorithms for the Longest Common Subsequence of Three (or More) Strings , 1992, CPM.
[16] David Maier,et al. The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.
[17] D. Lipman,et al. Trees, stars, and multiple biological sequence alignment , 1989 .