Author:
Burcsi Péter,Fici Gabriele,Lipták Zsuzsanna,Ruskey Frank,Sawada Joe
Publisher
Springer International Publishing
Reference19 articles.
1. Badkobeh, G., Fici, G., Kroon, S., Lipták, Z.: Binary jumbled string matching for highly run-length compressible texts. Inf. Process. Lett. 113(17), 604–608 (2013)
2. Lecture Notes in Computer Science;P. Burcsi,2010
3. Burcsi, P., Cicalese, F., Fici, G., Lipták, Z.: On approximate jumbled pattern matching in strings. Theory Comput. Syst. 50(1), 35–51 (2012)
4. Butman, A., Eres, R., Landau, G.M.: Scaled and permuted string matching. Inf. Process. Lett. 92(6), 293–297 (2004)
5. Cicalese, F., Fici, G., Lipták, Z.: Searching for jumbled patterns in strings. In: Proc. of the Prague Stringology Conference 2009 (PSC 2009), pp. 105–117. Czech Technical University in Prague (2009)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On infinite prefix normal words;Theoretical Computer Science;2021-03
2. Weighted Prefix Normal Words: Mind the Gap;Developments in Language Theory;2021
3. Generating a Gray code for prefix normal words in amortized polylogarithmic time per word;Theoretical Computer Science;2020-11
4. On Collapsing Prefix Normal Words;Language and Automata Theory and Applications;2020
5. On Infinite Prefix Normal Words;SOFSEM 2019: Theory and Practice of Computer Science;2019