Modern Pattern Matching

Informazioni relative al progetto

MPM

ID dell’accordo di sovvenzione: 683064

DOI

10.3030/683064

Progetto chiuso

Data della firma CE 19 Dicembre 2016

Data di avvio 1 Luglio 2017

Data di completamento 31 Agosto 2025

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale

€ 1 994 609,00

Contributo UE

€ 1 994 609,00

Coordinato da

BAR ILAN UNIVERSITY
Israel

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Conference proceedings (27)

Faster Approximate Pattern Matching: A Unified Approach

Autori: Charalampopoulos, Panagiotis; Kociumaka, Tomasz; Wellnitz, Philip
Pubblicato in: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), Numero 61, 2020, Pagina/e 978-989
Editore: IEEE
DOI: 10.1109/focs46700.2020.00095

String Factorization via Prefix Free Families

Autori: Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, Yonathan Sadia
Pubblicato in: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, Marne-la-Vall{'}ee, France, June 26-28, 2023, Numero 259, 2023, Pagina/e 19:1--19:10
Editore: "Schloss Dagstuhl - Leibniz-Zentrum f{""}ur Informatik"
DOI: 10.4230/lipics.cpm.2023.19

Time-Space Tradeoffs for Finding a Long Common Substring

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

Support Optimality and Adaptive Cuckoo Filters

Autori: Tsvi Kopelowitz; Samuel McCauley; Ely Porat
Pubblicato in: Algorithms and Data Structures - 17th International Symposium, {WADS}, Numero 1, 2021
Editore: Springer
DOI: 10.1007/978-3-030-83508-8_40

String Problems in the Congested Clique Model

Autori: Shay Golan, Matan Kraus
Pubblicato in: 36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025, Milan, Italy, June 17-19, 2025, Numero 331, 2025, Pagina/e 6:1--6:23
Editore: "Schloss Dagstuhl - Leibniz-Zentrum f{""}ur Informatik"
DOI: 10.4230/lipics.cpm.2025.6

Towards a Definitive Measure of Repetitiveness

Autori: Tomasz Kociumaka; Gonzalo Navarro; Nicola Prezza
Pubblicato in: 14TH LATIN AMERICAN THEORETICAL INFORMATICS SYMPOSIUM, Numero 1, 2020
Editore: Springer
DOI: 10.1007/978-3-030-61792-9_17

Improved Circular $k$-Mismatch Sketches

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

Incremental Edge Orientation in Forests

Autori: Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein:
Pubblicato in: 29th Annual European Symposium on Algorithms (ESA 2021), 2021, Pagina/e 12:1--12:18, ISBN 978-3-95977-204-4
Editore: "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

Autori: Ben-Nun, Stav; Kopelowitz, Tsvi; Kraus, Matan; Porat, Ely
Pubblicato in: {PODC} '20: {ACM} Symposium on Principles of Distributed Computing, Numero 1, 2020
Editore: ACM
DOI: 10.1145/3382734.3405747

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

Autori: Dvir Fried ,Tsvi Kopelowitz ,Ely Porat
Pubblicato in: 2024
Editore: "Schloss Dagstuhl - Leibniz-Zentrum f{""o""}r Informatik"
DOI: 10.4230/lipics.esa.2024.57

Hairpin Completion Distance Lower Bound

Autori: Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus
Pubblicato in: 35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, Fukuoka, Japan, June 25-27, 2024, Numero 296, 2024, Pagina/e 11:1--11:16
Editore: "Schloss Dagstuhl - Leibniz-Zentrum f{""}ur Informatik"
DOI: 10.4230/lipics.cpm.2024.11

RLE edit distance in near optimal time

Autori: Clifford, Raphaël; Gawrychowski, Pawel; Kociumaka, Tomasz; Martin, Daniel P.; Uznanski, Przemyslaw
Pubblicato in: 44th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2019, 2019
Editore: "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

Autori: Ido Tziony, Jonathan Mandl, Kobi Shapira, Eli Eisenberg, Ely Porat, Yaron Orenstein
Pubblicato in: Proceedings of the 15th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics, 2025, Pagina/e 1-10
Editore: ACM
DOI: 10.1145/3698587.3701363

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

Autori: Golan, Shay; Kociumaka, Tomasz; Kopelowitz, Tsvi; Porat, Ely
Pubblicato in: 31st Annual Symposium on Combinatorial Pattern Matching, {CPM} 2020, 2020, Pagina/e 15:1--15:15
Editore: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.cpm.2020.15

Distance Labeling for Families of Cycles

Autori: Shur, Arseny M.; Rubinchik, Mikhail
Pubblicato in: SOFSEM 2024: Theory and Practice of Computer Science, Numero 49, 2024, Pagina/e 471–484, ISBN 978-3-031-52113-3
Editore: Springer, Cham
DOI: 10.1007/978-3-031-52113-3_33

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

Autori: Dominik Kempa; Tomasz Kociumaka
Pubblicato in: Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC}, Numero 5, 2019
Editore: ACM
DOI: 10.1145/3313276.3316368

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

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

Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest

Autori: Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter
Pubblicato in: Proceeding SPAA '18 Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018, Pagina/e 333-341, ISBN 978-1-4503-5799-9
Editore: ACM
DOI: 10.1145/3210377.3210403

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

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

Weighted Shortest Common Supersequence Problem Revisited

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

Quasi-Linear-Time Algorithm for Longest Common Circular Factor

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

Improved Circular $k$-Mismatch Sketches

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

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

Autori: Goldstein, Isaac; Lewenstein, Moshe; Porat, Ely
Pubblicato in: 30th International Symposium on Algorithms and Computation, {ISAAC} 2019, Numero 2, 2019
Editore: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.isaac.2019.7

Resolution of the Burrows-Wheeler Transform Conjecture

Autori: Dominik Kempa; Tomasz Kociumaka
Pubblicato in: 61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}, Numero 1, 2020
Editore: IEEE
DOI: 10.1109/focs46700.2020.00097

Searching 2D-Strings for Matching Frames

Autori: Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny Shur
Pubblicato in: 35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, Fukuoka, Japan, June 25-27, 2024, Numero 296, 2024, Pagina/e 10:1--10:19
Editore: "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

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

On Longest Common Property Preserved Substring Queries

Autori: Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
Pubblicato in: String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7–9, 2019, Proceedings, Numero 11811, 2019, Pagina/e 162-174, ISBN 978-3-030-32685-2
Editore: 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

Autori: Ohad Amosy, Tamuz Danzig, Ohad Lev, Ely Porat, Gal Chechik, Adi Makmal
Pubblicato in: Quantum Machine Intelligence, Numero 6, 2024, ISSN 2524-4906
Editore: Springer Science and Business Media LLC
DOI: 10.1007/s42484-024-00159-y

Indexing weighted sequences: Neat and efficient

Autori: Carl Barton; Tomasz Kociumaka; Tomasz Kociumaka; Chang Liu; Solon P. Pissis; Jakub Radoszewski
Pubblicato in: Information and Computation,, Numero 270, 2020, ISSN 0890-5401
Editore: Academic Press
DOI: 10.1016/j.ic.2019.104462

Internal Dictionary Matching

Autori: Panagiotis Charalampopoulos; Tomasz Kociumaka; Manal Mohamed; Jakub Radoszewski; Jakub Radoszewski; Wojciech Rytter; Tomasz Waleń
Pubblicato in: Algorithmica, Numero 83, 2021, Pagina/e 2142–2169, ISSN 1432-0541
Editore: Springer
DOI: 10.1007/s00453-021-00821-y

Partial permutations comparison, maintenance and applications

Autori: Avivit Levy, Ely Porat, B. Riva Shalom
Pubblicato in: Theoretical Computer Science, Numero 1054, 2025, Pagina/e 115433, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2025.115433

String Periods in the Order-Preserving Model

Autori: Garance Gourdel; Tomasz Kociumaka; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Arseny M. Shur; Tomasz Waleń
Pubblicato in: Information and Computation, Numero 270, 2020, ISSN 0890-5401
Editore: Academic Press
DOI: 10.1016/j.ic.2019.104463

Optimal-Time Dictionary-Compressed Indexes

Autori: Anders Roy Christiansen; Mikko Berggren Ettienne; Tomasz Kociumaka; Gonzalo Navarro; Nicola Prezza
Pubblicato in: ACM Transactions on Algorithms, Numero 17, 2021, Pagina/e 8:1-8:39, ISSN 1549-6333
Editore: Association for Computing Machinery, New York, NY, United States
DOI: 10.1145/3426473

Toward a Definitive Compressibility Measure for Repetitive Sequences

Autori: Tomasz Kociumaka; Gonzalo Navarro; Nicola Prezza
Pubblicato in: IEEE Transactions on Information Theory, Numero 69, 2023, Pagina/e 2074 - 2092, ISSN 1557-9654
Editore: IEEE
DOI: 10.1109/tit.2022.3224382

Circular Pattern Matching with k Mismatches.

Autori: Panagiotis Charalampopoulos; Tomasz Kociumaka; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszyński; Tomasz Waleń; Wiktor Zuba
Pubblicato in: Journal of Computer and System Sciences, Numero 115, 2024, Pagina/e 73-85, ISSN 0022-0000
Editore: Academic Press
DOI: 10.1016/j.jcss.2020.07.003

Maximal unbordered factors of random strings

Autori: Patrick Hagge Cording; Travis Gagie; Mathias Bæk Tejs Knudsen; Tomasz Kociumaka; Tomasz Kociumaka
Pubblicato in: Theor. Comput. Sci., Numero 2, 2021, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2020.11.019

Book chapters (3)

Burst Edit Distance

Autori: Itai Boneh, Shay Golan, Avivit Levy, Ely Porat, B. Riva Shalom
Pubblicato in: Lecture Notes in Computer Science, String Processing and Information Retrieval, Numero 41--56, 2024, Pagina/e 41-56
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-031-72200-4_4

Locally Consistent Parsing for Text Indexing in Small Space

Autori: Or Birenzwige, Shay Golan, Ely Porat
Pubblicato in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Pagina/e 607-626
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.37

Monitoring Distributed Systems Based on Partial Order Executions with Global States

Autori: Moran Omer, Doron Peled, Ely Porat, Vijay K. Garg
Pubblicato in: Lecture Notes in Computer Science, Runtime Verification, 2025, Pagina/e 252-273
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-032-05435-7_15

Other (2)

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

Autori: Barr, Hodaya; Kopelowitz, Tsvi; Porat, Ely; Roditty, Liam
Pubblicato in: ARXIV, Numero 1, 2019
Editore: ARXIV

The Strong 3SUM-INDEXING Conjecture is False

Autori: Kopelowitz, Tsvi; Porat, Ely
Pubblicato in: ARXIV, Numero 1, 2019
Editore: ARXIV