论文信息 - Computing the Minimum λ-Cover in Weighted Sequences - 字舞流文

Computing the Minimum λ-Cover in Weighted Sequences

Costas S. Iliopoulos | Hui Zhang | Qing Guo | C. Iliopoulos | Hui Zhang | Qing Guo

[1] Costas S. Iliopoulos,et al. Computation of Repetitions and Regularities of Biologically Weighted Sequences , 2006, J. Comput. Biol..

[2] Costas S. Iliopoulos,et al. Varieties of Regularities in Weighted Sequences , 2010, AAIM.

[3] Richard Cole,et al. Computing the Minimum k-Cover of a String , 2003, Stringology.

[4] Yin Li,et al. Computing the Cover Array in Linear Time , 2001, Algorithmica.

[5] Costas S. Iliopoulos,et al. New complexity results for the k-covers problem , 2011, Inf. Sci..

[6] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[7] Nick Pacf,et al. Protein and peptide letters: editors Ben Dunn and Laurence Pearl, Bentham Science Publishers B.V., $60.00 (individual); $155.00 (institutional) , 1995 .

[8] Dany Breslauer,et al. An On-Line String Superprimitivity Test , 1992, Inf. Process. Lett..

[9] Costas S. Iliopoulos,et al. Computing the lambda-covers of a string , 2007, Inf. Sci..

[10] Jing Fan,et al. Loose and strict repeats in weighted sequences of proteins. , 2010, Protein and peptide letters.

[11] Maxime Crochemore,et al. An Optimal Algorithm for Computing the Repetitions in a Word , 1981, Inf. Process. Lett..

[12] Costas S. Iliopoulos,et al. Optimal Superprimitivity Testing for Strings , 1991, Inf. Process. Lett..

[13] Costas S. Iliopoulos,et al. A New Efficient Algorithm for Computing the Longest Common Subsequence , 2007, AAIM.