Panagiotis Charalampopoulos

Samah Ghazawi

CoRR, 2024

Pattern Matching with Mismatches and Wildcards.

[BibT_eX]

[DOI]

Gabriel Bathie

Tatiana Starikovskaya

CoRR, 2024

Approximate Circular Pattern Matching Under Edit Distance.

[BibT_eX]

[DOI]

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

2023

Almost Optimal Exact Distance Oracles for Planar Graphs.

[BibT_eX]

[DOI]

Christian Wulff-Nilsen

J. ACM, April, 2023

Optimal Heaviest Induced Ancestors.

[BibT_eX]

[DOI]

Bartlomiej Dudek

Karol Pokorski

CoRR, 2023

Optimal Near-Linear Space Heaviest Induced Ancestors.

[BibT_eX]

[DOI]

Bartlomiej Dudek

Karol Pokorski

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

2022

Fault-tolerant distance labeling for planar graphs.

[BibT_eX]

[DOI]

Aviv Bar-Natan

Theor. Comput. Sci., 2022

Internal shortest absent word queries in constant time and linear space.

[BibT_eX]

[DOI]

Golnaz Badkobeh

Dmitry Kosolobov

Theor. Comput. Sci., 2022

Exact Distance Oracles for Planar Graphs with Failing Vertices.

[BibT_eX]

[DOI]

Benjamin Tebeka

ACM Trans. Algorithms, 2022

Single-source shortest paths and strong connectivity in dynamic planar graphs.

[BibT_eX]

[DOI]

Adam Karczmarz

J. Comput. Syst. Sci., 2022

Faster Pattern Matching under Edit Distance.

[BibT_eX]

[DOI]

Philip Wellnitz

CoRR, 2022

Efficient Computation of Sequence Mappability.

[BibT_eX]

[DOI]

Algorithmica, 2022

On the Hardness of Computing the Edit Distance of Shallow Trees.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2022

Subsequence Covers of Words.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2022

Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices.

[BibT_eX]

[DOI]

Philip Wellnitz

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Approximate Circular Pattern Matching.

[BibT_eX]

[DOI]

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

Longest Palindromic Substring in Sublinear Time.

[BibT_eX]

[DOI]

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

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

Pattern Masking for Dictionary Matching.

[BibT_eX]

[DOI]

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

An Almost Optimal Edit Distance Oracle.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 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

Internal Shortest Absent Word Queries.

[BibT_eX]

[DOI]

Golnaz Badkobeh

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

2020

Data structures for strings in the internal and dynamic settings

[BibT_eX]

[DOI]

PhD thesis, 2020

Faster algorithms for 1-mappability of a sequence.

[BibT_eX]

[DOI]

Mai Alzamel

Theor. Comput. Sci., 2020

Property Suffix Array with Applications in Indexing Weighted Sequences.

[BibT_eX]

[DOI]

Chang Liu

ACM J. Exp. Algorithmics, 2020

SMART: SuperMaximal approximate repeats tool.

[BibT_eX]

[DOI]

Bioinform., 2020

Dynamic and Internal Longest Common Substring.

[BibT_eX]

[DOI]

Algorithmica, 2020

Efficient Enumeration of Distinct Factors Using Package Representations.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2020

Dynamic Longest Common Substring in Polylogarithmic Time.

[BibT_eX]

[DOI]

Karol Pokorski

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Faster Approximate Pattern Matching: A Unified Approach.

[BibT_eX]

[DOI]

Philip Wellnitz

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

The Number of Repetitions in 2D-Strings.

[BibT_eX]

[DOI]

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

Unary Words Have the Smallest Levenshtein k-Neighbourhoods.

[BibT_eX]

[DOI]

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

Dynamic String Alignment.

[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

On overabundant words and their application to biological sequence analysis.

[BibT_eX]

[DOI]

Yannis Almirantis

Dimitris Polychronopoulos

Theor. Comput. Sci., 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

Almost optimal distance oracles for planar graphs.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Weighted Shortest Common Supersequence Problem Revisited.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 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

Repetition Detection in a Dynamic String.

[BibT_eX]

[DOI]

Itai Boneh

Eitan Kondratovsky

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

2018

Palindromic Decompositions with Gaps and Errors.

[BibT_eX]

[DOI]

Michal Adamczyk

Mai Alzamel

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

Alignment-free sequence comparison using absent words.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Preface.

[BibT_eX]

[DOI]

Maxime Crochemore

Fundam. Informaticae, 2018

Longest Common Factor Made Fully Dynamic.

[BibT_eX]

[DOI]

CoRR, 2018

Longest Common Prefixes with k-Errors and Applications.

[BibT_eX]

[DOI]

CoRR, 2018

On Extended Special Factors of a Word.

[BibT_eX]

[DOI]

Maxime Crochemore

Proceedings of the String Processing and Information Retrieval, 2018

Longest Common Prefixes with k-Errors and Applications.

[BibT_eX]

[DOI]

Carl Barton

Proceedings of the String Processing and Information Retrieval, 2018

Efficient Computation of Sequence Mappability.

[BibT_eX]

[DOI]

Mai Alzamel

Proceedings of the String Processing and Information Retrieval, 2018

Longest Common Prefixes with k-Mismatches and Applications.

[BibT_eX]

[DOI]

Hayam Alamro

Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

Property Suffix Array with Applications.

[BibT_eX]

[DOI]

Chang Liu

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Linear-Time Algorithm for Long LCF with k Mismatches.

[BibT_eX]

[DOI]