A hyper-heuristic for the Longest Common Subsequence problem
暂无分享,去创建一个
[1] Sayyed Rasoul Mousavi,et al. An improved algorithm for the longest common subsequence problem , 2012, Comput. Oper. Res..
[2] L. Holm,et al. The Pfam protein families database , 2011, Nucleic Acids Res..
[3] Qingguo Wang,et al. A Fast Multiple Longest Common Subsequence (MLCS) Algorithm , 2011, IEEE Transactions on Knowledge and Data Engineering.
[4] Qingguo Wang,et al. A Fast Heuristic Search Algorithm for Finding the Longest Common Subsequence of Multiple Strings , 2010, AAAI.
[5] Manuel López-Ibáñez,et al. Beam search for the longest common subsequence problem , 2009, Comput. Oper. Res..
[6] Yi Shang,et al. Efficient Dominant Point Algorithms for the Multiple Longest Common Subsequence (MLCS) Problem , 2009, IJCAI.
[7] Qingguo Wang,et al. An Efficient Parallel Algorithm for the Multiple Longest Common Subsequence (MLCS) Problem , 2008, 2008 37th International Conference on Parallel Processing.
[8] Todd Easton,et al. A large neighborhood search heuristic for the longest common subsequence problem , 2008, J. Heuristics.
[9] Christian Blum,et al. Probabilistic Beam Search for the Longest Common Subsequence Problem , 2007, SLS.
[10] Yixin Chen,et al. A fast parallel algorithm for finding the longest common sequence of multiple biosequences , 2006, BMC Bioinformatics.
[11] Alain Guénoche,et al. Supersequences of Masks for Oligo-chips , 2004, J. Bioinform. Comput. Biol..
[12] Majid Sarrafzadeh,et al. Area-efficient instruction set synthesis for reconfigurable system-on-chip designs , 2004, Proceedings. 41st Design Automation Conference, 2004..
[13] Paola Bonizzoni,et al. Experimenting an approximation algorithm for the LCS , 2001, Discret. Appl. Math..
[14] R. Ravi,et al. Computing Similarity between RNA Strings , 1996, CPM.
[15] Francis Y. L. Chin,et al. Performance analysis of some simple heuristics for computing longest common subsequences , 1994, Algorithmica.
[16] Tao Jiang,et al. On the Approximation of Shortest Common Supersequences and Longest Common Subsequences , 1994, SIAM J. Comput..
[17] Hiroshi Imai,et al. The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings , 1992, ISAAC.
[18] David Eppstein,et al. Sparse dynamic programming II: convex and concave cost functions , 1992, JACM.
[19] Robert W. Irving,et al. Two Algorithms for the Longest Common Subsequence of Three (or More) Strings , 1992, CPM.
[20] J. Storer. Data Compression: Methods and Theory , 1987 .
[21] M. W. Du,et al. Computing a longest common subsequence for a set of strings , 1984, BIT.
[22] David Sankoff,et al. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .
[23] M S Waterman,et al. Identification of common molecular subsequences. , 1981, Journal of molecular biology.
[24] Daniel S. Hirschberg,et al. A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.
[25] 田中 俊典. National Center for Biotechnology Information (NCBI) , 2012 .
[26] K. Ning. Deposition and extension approach to find longest common subsequence for thousands of long sequences , 2010, Comput. Biol. Chem..
[27] Shyong Jian Shyu,et al. Finding the longest common subsequence for multiple biological sequences by ant colony optimization , 2009, Comput. Oper. Res..
[28] Todd Easton,et al. A Specialized Branching and Fathoming Technique for The Longest Common Subsequence Problem , 2007 .
[29] Chang-Biau Yang,et al. Fast Algorithms for Finding the Common Subsequence of Multiple Sequences , 2004 .
[30] Graham Kendall,et al. Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.
[31] Bin Ma,et al. A General Edit Distance between RNA Structures , 2002, J. Comput. Biol..
[32] Arindam Banerjee,et al. Clickstream clustering using weighted longest common subsequences , 2001 .
[33] Cameron Bruce Fraser,et al. Subsequences and Supersequences of Strings , 1995 .
[34] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .
[35] David S. Johnson,et al. The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.