A simple algorithm for the constrained sequence problems
暂无分享,去创建一个
Alfredo De Santis | Anna Lisa Ferrara | Francis Y. L. Chin | S. K. Kim | N. L. Ho | A. D. Santis | F. Chin | A. L. Ferrara | N. Ho
[1] Yin-Te Tsai,et al. The constrained longest common subsequence problem , 2003, Inf. Process. Lett..
[2] Prudence W. H. Wong,et al. Efficient constrained multiple sequence alignment with performance guarantee , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.
[3] Yin-Te Tsai,et al. Constrained multiple sequence alignment tool development and its application to RNase family alignment , 2002, Proceedings. IEEE Computer Society Bioinformatics Conference.
[4] M. Paterson,et al. A Faster Algorithm Computing String Edit Distances , 1980, J. Comput. Syst. Sci..
[5] David Maier,et al. The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.
[6] Daniel S. Hirschberg,et al. Algorithms for the Longest Common Subsequence Problem , 1977, JACM.
[7] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.