Tatiana Starikovskaya

Panagiotis Charalampopoulos

CoRR, 2024

Pattern Matching with Mismatches and Wildcards.

[BibT_eX]

[DOI]

Gabriel Bathie

CoRR, 2024

Sorting Signed Permutations by Reversals in Nearly-Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2023

Publisher Correction: Longest Common Substring with Approximately k Mismatches.

[BibT_eX]

[DOI]

Algorithmica, October, 2023

Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares.

[BibT_eX]

[DOI]

Gabriel Bathie

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Compressed Indexing for Consecutive Occurrences.

[BibT_eX]

[DOI]

Teresa Anna Steiner

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

2022

Streaming Dictionary Matching with Mismatches.

[BibT_eX]

[DOI]

Algorithmica, 2022

Pattern Matching Under DTW Distance.

[BibT_eX]

[DOI]

Anne Driemel

Pierre Peterlongo

Proceedings of the String Processing and Information Retrieval, 2022

An Improved Algorithm for The k-Dyck Edit Distance Problem.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Streaming Regular Expression Membership and Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Streaming Pattern Matching (Invited Talk).

[BibT_eX]

[DOI]

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

Property Testing of Regular Languages with Applications to Streaming Property Testing of Visibly Pushdown Languages.

[BibT_eX]

[DOI]

Gabriel Bathie

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Small-space and streaming pattern matching with $k$ edits.

[BibT_eX]

[DOI]

Ely Porat

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Streaming k-mismatch with error correcting and applications.

[BibT_eX]

[DOI]

Inf. Comput., 2020

All non-trivial variants of 3-LDT are equivalent.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Generalised Pattern Matching Revisited.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP.

[BibT_eX]

[DOI]

Kotaro Matsuda

Kunihiko Sadakane

Masakazu Tateshita

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

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

[BibT_eX]

[DOI]

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

Lp Pattern Matching in a Stream.

[BibT_eX]

[DOI]

Michal Svagerka

Przemyslaw Uznanski

Proceedings of the Approximation, 2020

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

Lower bounds for text indexing with mismatches and differences.

[BibT_eX]

[DOI]

Vincent Cohen-Addad

Laurent Feuilloley

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Sliding Window Property Testing for Regular Languages.

[BibT_eX]

[DOI]

Moses Ganardi

Danny Hucke

Markus Lohrey

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Quasi-Periodicity in Streams.

[BibT_eX]

[DOI]

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

2018

Upper and Lower Bounds for Dynamic Data Structures on Strings.

[BibT_eX]

[DOI]

Raphaël Clifford

Allan Grønlund

Kasper Green Larsen

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Improved bounds for testing Dyck languages.

[BibT_eX]

[DOI]

Eldar Fischer

Frédéric Magniez

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Fast Entropy-Bounded String Dictionary Look-Up with Mismatches.

[BibT_eX]

[DOI]

Gad M. Landau

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017

Streaming K-Mismatch with Error Correcting and Applications.

[BibT_eX]

[DOI]

Proceedings of the 2017 Data Compression Conference, 2017

Communication and Streaming Complexity of Approximate Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

Computing minimal and maximal suffixes of a substring.

[BibT_eX]

[DOI]

Ignat I. Kolesnichenko

Theor. Comput. Sci., 2016

Streaming k-mismatch with data recovery and applications.

[BibT_eX]

[DOI]

CoRR, 2016

Dynamic and Approximate Pattern Matching in 2D.

[BibT_eX]

[DOI]

Raphaël Clifford

Allyx Fontaine

Proceedings of the String Processing and Information Retrieval, 2016

The k-mismatch problem revisited.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Approximate Hamming Distance in a Stream.

[BibT_eX]

[DOI]

Raphaël Clifford

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Longest Common Substring with Approximately k Mismatches.

[BibT_eX]

[DOI]

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

2015

A suffix tree or not a suffix tree?

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

The k-mismatch problem revisited.

[BibT_eX]

[DOI]

CoRR, 2015

Computing the Longest Unbordered Substring.

[BibT_eX]

[DOI]

Benjamin Sach

Proceedings of the String Processing and Information Retrieval, 2015

Wavelet Trees Meet Suffix Trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Dictionary Matching in a Stream.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

On Maximal Unbordered Factors.

[BibT_eX]

[DOI]

Alexander Loptev

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

Cross-document pattern matching.

[BibT_eX]

[DOI]

Tsvi Kopelowitz

J. Discrete Algorithms, 2014

Simple and Efficient String Algorithms for Query Suggestion Metrics Computation.

[BibT_eX]

[DOI]

Alexander Loptev

Anna Selugina

Proceedings of the String Processing and Information Retrieval, 2014

Sublinear Space Algorithms for the Longest Common Substring Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

Computing Minimal and Maximal Suffixes of a Substring Revisited.

[BibT_eX]

[DOI]

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

2013

Substring Suffix Selection.

[BibT_eX]

[DOI]

CoRR, 2013

Minimal Discriminating Words Problem Revisited.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2013

Time-Space Trade-Offs for the Longest Common Substring Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

On Minimal and Maximal Suffixes of a Substring.

[BibT_eX]

[DOI]

Ignat I. Kolesnichenko

Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012

Computing Discriminating and Generic Words.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2012

Computing Lempel-Ziv Factorization Online.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Cross-Document Pattern Matching.

[BibT_eX]

[DOI]

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

2011

Computing the longest common substring with one mismatch.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2011

Linear pattern matching on sparse suffix trees

[BibT_eX]

[DOI]

Roman Kolpakov

CoRR, 2011

Pattern Matching on Sparse Suffix Trees.

[BibT_eX]

[DOI]

Roman Kolpakov

Proceedings of the First International Conference on Data Compression, 2011

2008

Computing Longest Common Substrings Via Suffix Arrays.

[BibT_eX]

[DOI]