Author:
Czajka Patryk,Radoszewski Jakub
Funder
Foundation for Polish Science
Subject
General Computer Science,Theoretical Computer Science
Reference60 articles.
1. Computing covers using prefix tables;Alatabbi;Discrete Appl. Math.,2016
2. Two strings at Hamming distance 1 cannot be both quasiperiodic;Amir;Inf. Process. Lett.,2017
3. Can we recover the cover?;Amir;Algorithmica,2019
4. Approximate cover of strings;Amir;Theor. Comput. Sci.,2019
5. Quasi-periodicity under mismatch errors;Amir,2018
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Subsequence Covers of Words;2024
2. String Covering: A Survey;Fundamenta Informaticae;2023-10-27
3. String Covers of a Tree Revisited;String Processing and Information Retrieval;2023
4. Subsequence Covers of Words;String Processing and Information Retrieval;2022
5. Sequential linked data: The state of affairs;Semantic Web;2021-10-04