Jakub Radoszewski

Algorithmica, June, 2024

Internal Pattern Matching Queries in a Text and Applications.

[BibT_eX]

[DOI]

SIAM J. Comput., 2024

Elastic-Degenerate String Comparison.

[BibT_eX]

[DOI]

CoRR, 2024

A Note on the Maximum Number of k-Powers in a Finite Word.

[BibT_eX]

[DOI]

Shuo Li

Jakub Pachocki

Electron. J. Comb., 2024

Approximate Circular Pattern Matching Under Edit Distance.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Computing String Covers in Sublinear Time.

[BibT_eX]

[DOI]

Wiktor Zuba

Proceedings of the String Processing and Information Retrieval, 2024

Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words.

[BibT_eX]

[DOI]

Tomasz Walen

Proceedings of the String Processing and Information Retrieval, 2024

Maintaining the Size of LZ77 on Semi-Dynamic Strings.

[BibT_eX]

[DOI]

Hideo Bannai

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023

Publisher Correction: Longest Common Substring with Approximately k Mismatches.

[BibT_eX]

[DOI]

Algorithmica, October, 2023

Linear Time Construction of Cover Suffix Tree and Applications.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022

A periodicity lemma for partial words.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Efficient representation and counting of antipower factors in words.

[BibT_eX]

[DOI]

Inf. Comput., 2022

k-Approximate Quasiperiodicity Under Hamming and Edit Distance.

[BibT_eX]

[DOI]

Aleksander Kedzierski

Algorithmica, 2022

Efficient Computation of Sequence Mappability.

[BibT_eX]

[DOI]

Algorithmica, 2022

Subsequence Covers of Words.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2022

Approximate Circular Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Rectangular Tile Covers of 2D-Strings.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

Linear-Time Computation of Shortest Covers of All Rotations of a String.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

Longest Palindromic Substring in Sublinear Time.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Optimal skeleton and reduced Huffman trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Experimental evaluation of algorithms for computing quasiperiods.

[BibT_eX]

[DOI]

Patryk Czajka

Theor. Comput. Sci., 2021

Shortest covers of all cyclic shifts of a string.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Circular pattern matching with <i>k</i> mismatches.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

Internal Dictionary Matching.

[BibT_eX]

[DOI]

Algorithmica, 2021

String Covers of a Tree.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2021

Pattern Masking for Dictionary Matching.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Hardness of Detecting Abelian and Additive Square Factors in Strings.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Faster Algorithms for Longest Common Substring.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Computing Covers of 2D-Strings.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

Universal reconstruction of a string.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Faster algorithms for 1-mappability of a sequence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A Linear-Time Algorithm for Seeds Computation.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Streaming <i>k</i>-mismatch with error correcting and applications.

[BibT_eX]

[DOI]

Inf. Comput., 2020

String periods in the order-preserving model.

[BibT_eX]

[DOI]

Inf. Comput., 2020

Indexing weighted sequences: Neat and efficient.

[BibT_eX]

[DOI]

Inf. Comput., 2020

Dynamic and Internal Longest Common Substring.

[BibT_eX]

[DOI]

Algorithmica, 2020

Internal Quasiperiod Queries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2020

Efficient Enumeration of Distinct Factors Using Package Representations.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2020

Efficient Computation of 2-Covers of a String.

[BibT_eX]

[DOI]

Juliusz Straszynski

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

The Number of Repetitions in 2D-Strings.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Approximating Longest Common Substring with k mismatches: Theory and Practice.

[BibT_eX]

[DOI]

Garance Gourdel

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Unary Words Have the Smallest Levenshtein k-Neighbourhoods.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Counting Distinct Patterns in Internal Dictionary Matching.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

Special issue in honor of the 70th birthday of Prof. Wojciech Rytter.

[BibT_eX]

[DOI]

Maxime Crochemore

Theor. Comput. Sci., 2019

Pattern Matching and Consensus Problems on Weighted Sequences and Profiles.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

On-line weighted pattern matching.

[BibT_eX]

[DOI]

Inf. Comput., 2019

Correction to: Longest Common Substring with Approximately k Mismatches.

[BibT_eX]

[DOI]

Algorithmica, 2019

Longest Common Substring with Approximately k Mismatches.

[BibT_eX]

[DOI]

Algorithmica, 2019

Pattern Matching on Weighted Strings.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2019, 2019

Weighted Shortest Common Supersequence Problem Revisited.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

On the Cyclic Regularities of Strings.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Applications and Innovations, 2019

Circular Pattern Matching with k Mismatches.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Longest Common Substring Made Fully Dynamic.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Quasi-Periodicity in Streams.

[BibT_eX]

[DOI]

Pawel Gawrychowski

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Quasi-Linear-Time Algorithm for Longest Common Circular Factor.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Efficient algorithms for shortest partial seeds in words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

On the string consensus problem and the Manhattan sequence consensus problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Palindromic Decompositions with Gaps and Errors.

[BibT_eX]

[DOI]

Michal Adamczyk

Int. J. Found. Comput. Sci., 2018

On Abelian Longest Common Factor with and without RLE.

[BibT_eX]

[DOI]

Szymon Grabowski

Fundam. Informaticae, 2018

Longest Common Factor Made Fully Dynamic.

[BibT_eX]

[DOI]

CoRR, 2018

Faster Recovery of Approximate Periods over Edit Distance.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2018

Efficient Computation of Sequence Mappability.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2018

How Much Different Are Two Words with Different Shortest Periods.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Applications and Innovations, 2018

Linear-Time Algorithm for Long LCF with k Mismatches.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017

Covering problems for partial words and for indeterminate strings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Fast algorithms for Abelian periods in words and greatest common divisor queries.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Two strings at Hamming distance 1 cannot be both quasiperiodic.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

String Powers in Trees.

[BibT_eX]

[DOI]

Algorithmica, 2017

Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet.

[BibT_eX]

[DOI]

Algorithmica, 2017

Longest Common Factor After One Edit Operation.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2017

Streaming K-Mismatch with Error Correcting and Applications.

[BibT_eX]

[DOI]

Proceedings of the 2017 Data Compression Conference, 2017

Palindromic Decompositions with Gaps and Errors.

[BibT_eX]

[DOI]

Michal Adamczyk

Proceedings of the Computer Science - Theory and Applications, 2017

2016

Maximum number of distinct and nonequivalent nonstandard squares in a word.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Order-preserving indexing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW).

[BibT_eX]

[DOI]

Tomasz Radzik

J. Discrete Algorithms, 2016

On the greedy algorithm for the Shortest Common Superstring problem with reversals.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Polynomial-time approximation algorithms for weighted LCS problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Streaming k-mismatch with data recovery and applications.

[BibT_eX]

[DOI]

CoRR, 2016

Parameterizing PWM- and Profile-Matching and Knapsack by the feasible-weight solutions count.

[BibT_eX]

[DOI]

CoRR, 2016

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2016

Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

Efficient Index for Weighted Sequences.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015

Linear-time version of Holub's algorithm for morphic imprimitivity testing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

A note on the longest common compatible prefix problem for partial words.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Fast Algorithm for Partial Covers in Words.

[BibT_eX]

[DOI]

Algorithmica, 2015

Efficient Algorithms for Longest Closed Factor Array.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2015

Subquadratic-Time Algorithms for Abelian Stringology Problems.

[BibT_eX]

[DOI]

Bartlomiej Wisniewski

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

2014

Efficient counting of square substrings in a tree.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Extracting powers and periods in a word from its runs structure.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

New simple efficient algorithms computing powers and runs in strings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

Efficient seed computation revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

A linear time algorithm for consecutive permutation pattern matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

A note on efficient computation of all Abelian periods in a string.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

On the maximum number of cubic subwords in a word.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Order-Preserving Suffix Trees and Their Algorithmic Applications

[BibT_eX]

[DOI]

CoRR, 2013

Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications.

[BibT_eX]

[DOI]

CoRR, 2013

Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2013

2012

On the structure of compacted subword graphs of Thue-Morse words and their applications.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

On the maximal sum of exponents of runs in a string.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

The maximal number of cubic runs in a word.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Efficient Data Structures for the Factor Periodicity Problem.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2012

The Maximum Number of Squares in a Tree.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Hamiltonian Paths in the Square of a Tree.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Efficient Seeds Computation Revisited.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010

Extracting Powers and Periods in a String from Its Runs Structure.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2010

Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup.

[BibT_eX]

[DOI]