On the generalized constrained longest common subsequence problems
暂无分享,去创建一个
[1] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.
[2] Ömer Egecioglu,et al. Algorithms For The Constrained Longest Common Subsequence Problems , 2005, Int. J. Found. Comput. Sci..
[3] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[4] Costas S. Iliopoulos,et al. A New Efficient Algorithm for Computing the Longest Common Subsequence , 2007, AAIM.
[5] Alfredo De Santis,et al. A simple algorithm for the constrained sequence problems , 2004, Information Processing Letters.
[6] Peter van Emde Boas,et al. Design and implementation of an efficient priority queue , 1976, Mathematical systems theory.
[7] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[8] Mike Paterson,et al. A Faster Algorithm Computing String Edit Distances , 1980, J. Comput. Syst. Sci..
[9] Daniel S. Hirschberg,et al. A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.
[10] Peter van Emde Boas,et al. Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space , 1977, Inf. Process. Lett..
[11] Alfred V. Aho,et al. Bounds on the Complexity of the Longest Common Subsequence Problem , 1976, J. ACM.
[12] P. Bonizzoni,et al. Exemplar Longest Common Subsequence , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[13] Yin-Te Tsai,et al. Constrained Multiple Sequence Alignment Tool Development Andits Application to Rnase Family Alignment , 2003, J. Bioinform. Comput. Biol..
[14] Yin-Te Tsai,et al. The constrained longest common subsequence problem , 2003, Inf. Process. Lett..
[15] Thomas G. Szymanski,et al. A fast algorithm for computing longest common subsequences , 1977, CACM.
[16] Moshe Lewenstein,et al. Constrained LCS: Hardness and Approximation , 2008, CPM.
[17] Prudence W. H. Wong,et al. Efficient constrained multiple sequence alignment with performance guarantee. , 2005, Proceedings. IEEE Computer Society Bioinformatics Conference.
[18] Costas S. Iliopoulos,et al. New efficient algorithms for the LCS and constrained LCS problems , 2008, Inf. Process. Lett..
[19] David Maier,et al. The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.
[20] L. Bergroth,et al. A survey of longest common subsequence algorithms , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.
[21] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[22] Alberto Apostolico,et al. The longest common subsequence problem revisited , 1987, Algorithmica.
[23] Kun-Mao Chao,et al. Sequence Comparison - Theory and Methods , 2008, Computational Biology.
[24] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[25] Pavel A. Pevzner,et al. Computational molecular biology : an algorithmic approach , 2000 .
[26] Alfred V. Aho,et al. Optimal Code Generation for Expression Trees , 1976, J. ACM.
[27] Daniel S. Hirschberg,et al. Algorithms for the Longest Common Subsequence Problem , 1977, JACM.