Sparse LCS Common Substring Alignment
暂无分享,去创建一个
[1] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[2] Gary Benson. A Space Efficient Algorithm for Finding the Best Nonoverlapping Alignment Score , 1995, Theor. Comput. Sci..
[3] Thomas G. Szymanski,et al. A fast algorithm for computing longest common subsequences , 1977, CACM.
[4] Alberto Apostolico,et al. String Editing and Longest Common Subsequences , 1997, Handbook of Formal Languages.
[5] David Eppstein,et al. Sparse dynamic programming I: linear cost functions , 1992, JACM.
[6] Daniel S. Hirschberg,et al. Algorithms for the Longest Common Subsequence Problem , 1977, JACM.
[7] Alok Aggarwal,et al. Geometric applications of a matrix-searching algorithm , 1987, SCG '86.
[8] Gad M. Landau,et al. On the Common Substring Alignment Problem , 2001, J. Algorithms.
[9] Jeanette P. Schmidt,et al. All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings , 1998, SIAM J. Comput..
[10] Sampath Kannan,et al. An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score , 1996, SIAM J. Comput..
[11] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[12] Gad M. Landau,et al. On the shared substring alignment problem , 2000, SODA '00.
[13] David Eppstein,et al. Sparse dynamic programming II: convex and concave cost functions , 1992, JACM.
[14] Alberto Apostolico,et al. The longest common subsequence problem revisited , 1987, Algorithmica.
[15] Sampath Kannan,et al. An Algorithm for Locating Non-Overlapping Regions of Maximum Alignment Score , 1993, CPM.
[16] Gad M. Landau,et al. A sub-quadratic sequence alignment algorithm for unrestricted cost matrices , 2002, SODA '02.