On the Expected Number of Distinct Gapped Palindromic Factors
暂无分享,去创建一个
[1] Florin Manea,et al. Longest Gapped Repeats and Palindromes , 2017, Discret. Math. Theor. Comput. Sci..
[2] David J. C. MacKay,et al. Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.
[3] Philippe Duchon,et al. Gapped Pattern Statistics , 2017, CPM.
[4] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[5] Gregory Kucherov,et al. Searching for Gapped Palindromes , 2008, CPM.
[6] Devdatt P. Dubhashi,et al. Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.
[7] Arseny M. Shur,et al. EERTREE: An efficient data structure for processing palindromes in strings , 2018, Eur. J. Comb..
[8] Philippe Duchon,et al. On the Biased Partial Word Collector Problem , 2018, LATIN.
[9] Shunsuke Inenaga,et al. Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes , 2017, Theory of Computing Systems.
[10] Hideo Bannai,et al. A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String , 2015, SPIRE.
[11] Maxime Crochemore,et al. Optimal Bounds for Computing \alpha α -gapped Repeats , 2016, LATA.
[12] Arseny M. Shur,et al. The Number of Distinct Subpalindromes in Random Words , 2016, Fundam. Informaticae.
[13] Mikhail Posypkin,et al. Searching of gapped repeats and subrepetitions in a word , 2017, J. Discrete Algorithms.