Modern Pattern Matching

Project Information

MPM

Grant agreement ID: 683064

DOI

10.3030/683064

Project closed

EC signature date 19 December 2016

Start date 1 July 2017

End date 31 August 2025

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 994 609,00

EU contribution

€ 1 994 609,00

Coordinated by

BAR ILAN UNIVERSITY
Israel

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Conference proceedings (27)

Faster Approximate Pattern Matching: A Unified Approach

Author(s): Charalampopoulos, Panagiotis; Kociumaka, Tomasz; Wellnitz, Philip
Published in: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), Issue 61, 2020, Page(s) 978-989
Publisher: IEEE
DOI: 10.1109/focs46700.2020.00095

String Factorization via Prefix Free Families

Author(s): Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, Yonathan Sadia
Published in: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, Marne-la-Vall{'}ee, France, June 26-28, 2023, Issue 259, 2023, Page(s) 19:1--19:10
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{""}ur Informatik"
DOI: 10.4230/lipics.cpm.2023.19

Time-Space Tradeoffs for Finding a Long Common Substring

Author(s): Ben-Nun, Stav; Golan, Shay; Kociumaka, Tomasz; Kraus, Matan
Published in: 31st Annual Symposium on Combinatorial Pattern Matching, {CPM} 2020, Issue 1, 2020
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.cpm.2020.5

Support Optimality and Adaptive Cuckoo Filters

Author(s): Tsvi Kopelowitz; Samuel McCauley; Ely Porat
Published in: Algorithms and Data Structures - 17th International Symposium, {WADS}, Issue 1, 2021
Publisher: Springer
DOI: 10.1007/978-3-030-83508-8_40

String Problems in the Congested Clique Model

Author(s): Shay Golan, Matan Kraus
Published in: 36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025, Milan, Italy, June 17-19, 2025, Issue 331, 2025, Page(s) 6:1--6:23
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{""}ur Informatik"
DOI: 10.4230/lipics.cpm.2025.6

Towards a Definitive Measure of Repetitiveness

Author(s): Tomasz Kociumaka; Gonzalo Navarro; Nicola Prezza
Published in: 14TH LATIN AMERICAN THEORETICAL INFORMATICS SYMPOSIUM, Issue 1, 2020
Publisher: Springer
DOI: 10.1007/978-3-030-61792-9_17

Improved Circular $k$-Mismatch Sketches

Author(s): Golan, Shay; Kociumaka, Tomasz; Kopelowitz, Tsvi; Porat, Ely; Uznański, Przemysław
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2020, Issue 5, 2020
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.approx/random.2020.46

Incremental Edge Orientation in Forests

Author(s): Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein:
Published in: 29th Annual European Symposium on Algorithms (ESA 2021), 2021, Page(s) 12:1--12:18, ISBN 978-3-95977-204-4
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.esa.2021.12

An $O(\log^{3/2}n)$ Parallel Time Population Protocol for Majority with $O(\log n)$ States

Author(s): Ben-Nun, Stav; Kopelowitz, Tsvi; Kraus, Matan; Porat, Ely
Published in: {PODC} '20: {ACM} Symposium on Principles of Distributed Computing, Issue 1, 2020
Publisher: ACM
DOI: 10.1145/3382734.3405747

Removing the log Factor from (min, +)-Products on Bounded Range Integer Matrices

Author(s): Dvir Fried ,Tsvi Kopelowitz ,Ely Porat
Published in: 2024
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{""o""}r Informatik"
DOI: 10.4230/lipics.esa.2024.57

Hairpin Completion Distance Lower Bound

Author(s): Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus
Published in: 35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, Fukuoka, Japan, June 25-27, 2024, Issue 296, 2024, Page(s) 11:1--11:16
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{""}ur Informatik"
DOI: 10.4230/lipics.cpm.2024.11

RLE edit distance in near optimal time

Author(s): Clifford, Raphaël; Gawrychowski, Pawel; Kociumaka, Tomasz; Martin, Daniel P.; Uznanski, Przemyslaw
Published in: 44th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2019, 2019
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik}"
DOI: 10.4230/lipics.mfcs.2019.66

FiSSC: Finding smallest sequence covers to sets of degenerate reads with applications to RNA editing

Author(s): Ido Tziony, Jonathan Mandl, Kobi Shapira, Eli Eisenberg, Ely Porat, Yaron Orenstein
Published in: Proceedings of the 15th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics, 2025, Page(s) 1-10
Publisher: ACM
DOI: 10.1145/3698587.3701363

The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time

Author(s): Golan, Shay; Kociumaka, Tomasz; Kopelowitz, Tsvi; Porat, Ely
Published in: 31st Annual Symposium on Combinatorial Pattern Matching, {CPM} 2020, 2020, Page(s) 15:1--15:15
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.cpm.2020.15

Distance Labeling for Families of Cycles

Author(s): Shur, Arseny M.; Rubinchik, Mikhail
Published in: SOFSEM 2024: Theory and Practice of Computer Science, Issue 49, 2024, Page(s) 471–484, ISBN 978-3-031-52113-3
Publisher: Springer, Cham
DOI: 10.1007/978-3-031-52113-3_33

String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure

Author(s): Dominik Kempa; Tomasz Kociumaka
Published in: Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC}, Issue 5, 2019
Publisher: ACM
DOI: 10.1145/3313276.3316368

A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance

Author(s): Kopelowitz, Tsvi ; Porat, Ely
Published in: 1st Symposium on Simplicity in Algorithms (SOSA 2018), 2018
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/oasics.sosa.2018.10

Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest

Author(s): Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter
Published in: Proceeding SPAA '18 Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018, Page(s) 333-341, ISBN 978-1-4503-5799-9
Publisher: ACM
DOI: 10.1145/3210377.3210403

Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams

Author(s): Golan, Shay ; Kopelowitz, Tsvi ; Porat, Ely
Published in: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), 2018, Page(s) 65:1--65:16, ISBN 978-3-95977-076-7
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2018.65

Weighted Shortest Common Supersequence Problem Revisited

Author(s): Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, Wiktor Zuba
Published in: String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7–9, 2019, Proceedings, Issue 11811, 2019, Page(s) 221-238, ISBN 978-3-030-32685-2
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-32686-9_16

Quasi-Linear-Time Algorithm for Longest Common Circular Factor

Author(s): Alzamel, Mai; Crochemore, Maxime; Iliopoulos, Costas S.; Kociumaka, Tomasz; Radoszewski, Jakub; Rytter, Wojciech; Straszynski, Juliusz; Walen, Tomasz; Zuba, Wiktor
Published in: 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), Issue 30, 2019, Page(s) 25:1-25:14, ISBN 978-3-95977-103-0
Publisher: Schloss-Dagstuhl - Leibniz Zentrum für Informatik
DOI: 10.4230/lipics.cpm.2019.25

Improved Circular $k$-Mismatch Sketches

Author(s): Golan, Shay; Kociumaka, Tomasz; Kopelowitz, Tsvi; Porat, Ely; Uznański, Przemysław
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM}, Issue 1, 2020
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"

On the Hardness of Set Disjointness and Set Intersection with Bounded Universe

Author(s): Goldstein, Isaac; Lewenstein, Moshe; Porat, Ely
Published in: 30th International Symposium on Algorithms and Computation, {ISAAC} 2019, Issue 2, 2019
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.isaac.2019.7

Resolution of the Burrows-Wheeler Transform Conjecture

Author(s): Dominik Kempa; Tomasz Kociumaka
Published in: 61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}, Issue 1, 2020
Publisher: IEEE
DOI: 10.1109/focs46700.2020.00097

Searching 2D-Strings for Matching Frames

Author(s): Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny Shur
Published in: 35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, Fukuoka, Japan, June 25-27, 2024, Issue 296, 2024, Page(s) 10:1--10:19
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{""}ur Informatik"
DOI: 10.4230/lipics.cpm.2024.10

An Improved Algorithm for The <i>k</i>-Dyck Edit Distance Problem

Author(s): Fried, Dvir; Golan, Shay; Kociumaka, Tomasz; Kopelowitz, Tsvi; Porat, Ely; Starikovskaya, Tatiana
Published in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Page(s) 3650 - 3669, ISBN 978-1-61197-707-3
Publisher: Society for Industrial and Applied Mathematics (SIAM)
DOI: 10.1137/1.9781611977073.144

On Longest Common Property Preserved Substring Queries

Author(s): Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
Published in: String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7–9, 2019, Proceedings, Issue 11811, 2019, Page(s) 162-174, ISBN 978-3-030-32685-2
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-32686-9_12

Peer reviewed articles (9)

Iteration-Free quantum approximate optimization algorithm using neural networks

Author(s): Ohad Amosy, Tamuz Danzig, Ohad Lev, Ely Porat, Gal Chechik, Adi Makmal
Published in: Quantum Machine Intelligence, Issue 6, 2024, ISSN 2524-4906
Publisher: Springer Science and Business Media LLC
DOI: 10.1007/s42484-024-00159-y

Indexing weighted sequences: Neat and efficient

Author(s): Carl Barton; Tomasz Kociumaka; Tomasz Kociumaka; Chang Liu; Solon P. Pissis; Jakub Radoszewski
Published in: Information and Computation,, Issue 270, 2020, ISSN 0890-5401
Publisher: Academic Press
DOI: 10.1016/j.ic.2019.104462

Internal Dictionary Matching

Author(s): Panagiotis Charalampopoulos; Tomasz Kociumaka; Manal Mohamed; Jakub Radoszewski; Jakub Radoszewski; Wojciech Rytter; Tomasz Waleń
Published in: Algorithmica, Issue 83, 2021, Page(s) 2142–2169, ISSN 1432-0541
Publisher: Springer
DOI: 10.1007/s00453-021-00821-y

Partial permutations comparison, maintenance and applications

Author(s): Avivit Levy, Ely Porat, B. Riva Shalom
Published in: Theoretical Computer Science, Issue 1054, 2025, Page(s) 115433, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2025.115433

String Periods in the Order-Preserving Model

Author(s): Garance Gourdel; Tomasz Kociumaka; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Arseny M. Shur; Tomasz Waleń
Published in: Information and Computation, Issue 270, 2020, ISSN 0890-5401
Publisher: Academic Press
DOI: 10.1016/j.ic.2019.104463

Optimal-Time Dictionary-Compressed Indexes

Author(s): Anders Roy Christiansen; Mikko Berggren Ettienne; Tomasz Kociumaka; Gonzalo Navarro; Nicola Prezza
Published in: ACM Transactions on Algorithms, Issue 17, 2021, Page(s) 8:1-8:39, ISSN 1549-6333
Publisher: Association for Computing Machinery, New York, NY, United States
DOI: 10.1145/3426473

Toward a Definitive Compressibility Measure for Repetitive Sequences

Author(s): Tomasz Kociumaka; Gonzalo Navarro; Nicola Prezza
Published in: IEEE Transactions on Information Theory, Issue 69, 2023, Page(s) 2074 - 2092, ISSN 1557-9654
Publisher: IEEE
DOI: 10.1109/tit.2022.3224382

Circular Pattern Matching with k Mismatches.

Author(s): Panagiotis Charalampopoulos; Tomasz Kociumaka; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszyński; Tomasz Waleń; Wiktor Zuba
Published in: Journal of Computer and System Sciences, Issue 115, 2024, Page(s) 73-85, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2020.07.003

Maximal unbordered factors of random strings

Author(s): Patrick Hagge Cording; Travis Gagie; Mathias Bæk Tejs Knudsen; Tomasz Kociumaka; Tomasz Kociumaka
Published in: Theor. Comput. Sci., Issue 2, 2021, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2020.11.019

Book chapters (3)

Burst Edit Distance

Author(s): Itai Boneh, Shay Golan, Avivit Levy, Ely Porat, B. Riva Shalom
Published in: Lecture Notes in Computer Science, String Processing and Information Retrieval, Issue 41--56, 2024, Page(s) 41-56
Publisher: Springer Nature Switzerland
DOI: 10.1007/978-3-031-72200-4_4

Locally Consistent Parsing for Text Indexing in Small Space

Author(s): Or Birenzwige, Shay Golan, Ely Porat
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Page(s) 607-626
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.37

Monitoring Distributed Systems Based on Partial Order Executions with Global States

Author(s): Moran Omer, Doron Peled, Ely Porat, Vijay K. Garg
Published in: Lecture Notes in Computer Science, Runtime Verification, 2025, Page(s) 252-273
Publisher: Springer Nature Switzerland
DOI: 10.1007/978-3-032-05435-7_15

Other (2)

$\{-1,0,1\}$-APSP and (min,max)-Product Problems

Author(s): Barr, Hodaya; Kopelowitz, Tsvi; Porat, Ely; Roditty, Liam
Published in: ARXIV, Issue 1, 2019
Publisher: ARXIV

The Strong 3SUM-INDEXING Conjecture is False

Author(s): Kopelowitz, Tsvi; Porat, Ely
Published in: ARXIV, Issue 1, 2019
Publisher: ARXIV