Efficient enumeration of non-equivalent squares in partial words with few holes-Reference-Cited by-同舟云学术

Efficient enumeration of non-equivalent squares in partial words with few holes

Published:2018-05-21 Issue:2 Volume:37 Page:501-522
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Charalampopoulos Panagiotis^ORCID,Crochemore Maxime^ORCID,Iliopoulos Costas S.^ORCID,Kociumaka Tomasz^ORCID,Pissis Solon P.^ORCID,Radoszewski Jakub^ORCID,Rytter Wojciech^ORCID,Waleń Tomasz^ORCID

Funder

Ministerstwo Nauki i Szkolnictwa Wyższego

Narodowe Centrum Nauki

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/article/10.1007/s10878-018-0300-z/fulltext.html

Reference22 articles.

1. Bannai H, Inenaga S, Köppl D (2017) Computing all distinct squares in linear time for integer alphabets. In: Kärkkäinen J, Radoszewski J, Rytter W (eds) 28th Annual symposium on combinatorial pattern matching, CPM 2017, LIPIcs, vol 78. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp 22:1–22:18. https://doi.org/10.4230/LIPIcs.CPM.2017.22

2. Blanchet-Sadri F, Mercaş R (2009) A note on the number of squares in a partial word with one hole. Inform Théor Appl 43(4):767–774. https://doi.org/10.1051/ita/2009019

3. Blanchet-Sadri F, Mercaş R (2012) The three-squares lemma for partial words with one hole. Theor Comput Sci 428:1–9. https://doi.org/10.1016/j.tcs.2012.01.012

4. Blanchet-Sadri F, Mercaş R, Scott G (2009) Counting distinct squares in partial words. Acta Cybern 19(2):465–477

5. Blanchet-Sadri F, Jiao Y, Machacek JM, Quigley J, Zhang X (2014a) Squares in partial words. Theor Comput Sci 530:42–57. https://doi.org/10.1007/978-3-642-31653-1_36