Enhanced string covering
暂无分享,去创建一个
Costas S. Iliopoulos | Solon P. Pissis | William F. Smyth | Simon J. Puglisi | Tomasz Kociumaka | Tomás Flouri | Wojciech Tyczynski | W. F. Smyth | S. Puglisi | S. Pissis | C. Iliopoulos | T. Flouri | T. Kociumaka | Wojciech Tyczynski
[1] Wojciech Rytter,et al. Efficient seed computation revisited , 2013, Theor. Comput. Sci..
[2] Costas S. Iliopoulos,et al. Optimal Superprimitivity Testing for Strings , 1991, Inf. Process. Lett..
[3] M. Crochemore,et al. Algorithms on Strings: Tools , 2007 .
[4] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..
[5] William F. Smyth,et al. Computing Patterns in Strings , 2003 .
[6] Wojciech Rytter,et al. Efficient Seeds Computation Revisited , 2011, CPM.
[7] Gregory Kucherov,et al. mreps: efficient and flexible detection of tandem repeats in DNA , 2003, Nucleic Acids Res..
[8] William F. Smyth,et al. A Correction to "An Optimal Algorithm to Compute all the Covers of a String" , 1995, Inf. Process. Lett..
[9] Richard Cole,et al. The Complexity of the Minimum k-Cover Problem , 2005, J. Autom. Lang. Comb..
[10] Andrzej Ehrenfeucht,et al. Efficient Detection of Quasiperiodicities in Strings , 1993, Theor. Comput. Sci..
[11] Dany Breslauer,et al. An On-Line String Superprimitivity Test , 1992, Inf. Process. Lett..
[12] Yin Li,et al. Computing the Cover Array in Linear Time , 2001, Algorithmica.
[13] William F. Smyth,et al. Computing regularities in strings: A survey , 2013, Eur. J. Comb..
[14] Costas S. Iliopoulos,et al. String Regularities with Don't Cares , 2003, Nord. J. Comput..
[15] Maxime Crochemore,et al. Algorithms on strings , 2007 .
[16] Costas S. Iliopoulos,et al. A Work-Time Optimal Algorithm for Computing All String Covers , 1996, Theor. Comput. Sci..
[17] William F. Smyth,et al. An Optimal Algorithm to Compute all the Covers of a String , 1994, Inf. Process. Lett..
[18] M. Lothaire,et al. Applied Combinatorics on Words , 2005 .
[19] Costas S. Iliopoulos,et al. On-line algorithms for k-Covering , 1998 .
[20] Maxime Crochemore,et al. On the Right-Seed Array of a String , 2011, COCOON.
[21] Costas S. Iliopoulos,et al. New complexity results for the k-covers problem , 2011, Inf. Sci..