researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
Links
Filter by Year
[-]
OR
AND
NOT
1
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
Filter by Tag
[+]
OR
AND
NOT
1
analysis
context-aware
data-flow
design
discovery
e-science
edit distance
grammar
graph-rewriting
modeling
optimization
parsimony
parsing
partitioning
pattern matching
programming
rewriting
rule-based
search
systematic-approach
Filter by Author
[+]
OR
AND
NOT
1
Amihood Amir
Costas S. Iliopoulos
Ely Porat
Gad M. Landau
Gonzalo Navarro
Hideo Bannai
Jakub Radoszewski
Juha Kärkkäinen
Kaizhong Zhang
Masayuki Takeda
Maxime Crochemore
Moshe Lewenstein
Pawel Gawrychowski
Philip Bille
Sharma V. Thankachan
Shunsuke Inenaga
Solon P. Pissis
Tomasz Kociumaka
Tomasz Walen
Wojciech Rytter
Filter by Top terms
[+]
OR
AND
NOT
1
algorithm
algorithms
alignment
approximate
combinatorial
common
compressed
distance
efficient
linear
longest
matching
pattern
problem
string
strings
suffix
time
tree
trees
CPM (cpm)
Editions
Publications
Viewing Publication 1 - 100 from 953
2023
Front Matter, Table of Contents, Preface, Conference Organization
cpm 2023
:
[doi]
Trie-Compressed Adaptive Set Intersection
Diego Arroyuelo
,
Juan Pablo Castillo
.
cpm 2023
:
[doi]
Approximation Algorithms for the Longest Run Subsequence Problem
Yuichi Asahiro
,
Hiroshi Eto
,
Mingyang Gong
,
Jesper Jansson 0001
,
Guohui Lin
,
Eiji Miyano
,
Hirotaka Ono
,
Shunichi Tanaka
.
cpm 2023
:
[doi]
Optimal LZ-End Parsing Is Hard
Hideo Bannai
,
Mitsuru Funakoshi
,
Kazuhiro Kurita
,
Yuto Nakashima
,
Kazuhisa Seto
,
Takeaki Uno
.
cpm 2023
:
[doi]
Sliding Window String Indexing in Streams
Philip Bille
,
Johannes Fischer 0001
,
Inge Li Gørtz
,
Max Rishøj Pedersen
,
Tord Joakim Stordalen
.
cpm 2023
:
[doi]
Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor
Itai Boneh
,
Dvir Fried
,
Adrian Miclaus
,
Alexandru Popa 0001
.
cpm 2023
:
[doi]
On Distances Between Words with Parameters
Pierre Bourhis
,
Aaron Boussidan
,
Philippe Gambette
.
cpm 2023
:
[doi]
34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France
Laurent Bulteau
,
Zsuzsanna Lipták
, editors,
Volume 259 of
LIPIcs
, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2023.
[doi]
Optimal Near-Linear Space Heaviest Induced Ancestors
Panagiotis Charalampopoulos
,
Bartlomiej Dudek 0001
,
Pawel Gawrychowski
,
Karol Pokorski
.
cpm 2023
:
[doi]
Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond
Manuel Cáceres
.
cpm 2023
:
[doi]
From Bit-Parallelism to Quantum String Matching for Labelled Graphs
Massimo Equi
,
Arianne Meijer-van de Griend
,
Veli Mäkinen
.
cpm 2023
:
[doi]
On the Impact of Morphisms on BWT-Runs
Gabriele Fici
,
Giuseppe Romana
,
Marinella Sciortino
,
Cristian Urbina
.
cpm 2023
:
[doi]
Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications
Estéban Gabory
,
Njagi Moses Mwaniki
,
Nadia Pisanti
,
Solon P. Pissis
,
Jakub Radoszewski
,
Michelle Sweering
,
Wiktor Zuba
.
cpm 2023
:
[doi]
Compressed Indexing for Consecutive Occurrences
Pawel Gawrychowski
,
Garance Gourdel
,
Tatiana Starikovskaya
,
Teresa Anna Steiner
.
cpm 2023
:
[doi]
Order-Preserving Squares in Strings
Pawel Gawrychowski
,
Samah Ghazawi
,
Gad M. Landau
.
cpm 2023
:
[doi]
MUL-Tree Pruning for Consistency and Compatibility
Christopher Hampson
,
Daniel J. Harvey
,
Costas S. Iliopoulos
,
Jesper Jansson 0001
,
Zara Lim
,
Wing-Kin Sung
.
cpm 2023
:
[doi]
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String
Costas S. Iliopoulos
,
Tomasz Kociumaka
,
Jakub Radoszewski
,
Wojciech Rytter
,
Tomasz Walen
,
Wiktor Zuba
.
cpm 2023
:
[doi]
Faster Prefix-Sorting Algorithms for Deterministic Finite Automata
Sung-Hwan Kim
,
Francisco Olivares
,
Nicola Prezza
.
cpm 2023
:
[doi]
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem
Christian Komusiewicz
,
Simone Linz
,
Nils Morawietz
,
Jannik Schestag
.
cpm 2023
:
[doi]
String Factorization via Prefix Free Families
Matan Kraus
,
Moshe Lewenstein
,
Alexandru Popa 0001
,
Ely Porat
,
Yonathan Sadia
.
cpm 2023
:
[doi]
Improving the Sensitivity of MinHash Through Hash-Value Analysis
Gregory Kucherov
,
Steven Skiena
.
cpm 2023
:
[doi]
Encoding Hard String Problems with Answer Set Programming
Dominik Köppl
.
cpm 2023
:
[doi]
Suffix-Prefix Queries on a Dictionary
Grigorios Loukides
,
Solon P. Pissis
,
Sharma V. Thankachan
,
Wiktor Zuba
.
cpm 2023
:
[doi]
Merging Sorted Lists of Similar Strings
Gene Myers
.
cpm 2023
:
[doi]
PalFM-Index: FM-Index for Palindrome Pattern Matching
Shinya Nagashita
,
Tomohiro I
.
cpm 2023
:
[doi]
Computing MEMs on Repetitive Text Collections
Gonzalo Navarro
.
cpm 2023
:
[doi]
L-Systems for Measuring Repetitiveness
Gonzalo Navarro
,
Cristian Urbina
.
cpm 2023
:
[doi]
MONI Can Find k-MEMs
Igor Tatarnikov
,
Ardavan Shahrabi Farahani
,
Sana Kashgouli
,
Travis Gagie
.
cpm 2023
:
[doi]
2022
Indexable Elastic Founder Graphs of Minimum Height
Nicola Rizzo 0001
,
Veli Mäkinen
.
cpm 2022
:
[doi]
Making de Bruijn Graphs Eulerian
Giulia Bernardini 0001
,
Huiping Chen
,
Grigorios Loukides
,
Solon P. Pissis
,
Leen Stougie
,
Michelle Sweering
.
cpm 2022
:
[doi]
On Strings Having the Same Length- k Substrings
Giulia Bernardini 0001
,
Alessio Conte
,
Esteban Gabory
,
Roberto Grossi
,
Grigorios Loukides
,
Solon P. Pissis
,
Giulia Punzi
,
Michelle Sweering
.
cpm 2022
:
[doi]
Front Matter, Table of Contents, Preface, Conference Organization
cpm 2022
:
[doi]
Minimal Absent Words on Run-Length Encoded Strings
Tooru Akagi
,
Kouta Okabe
,
Takuya Mieno
,
Yuto Nakashima
,
Shunsuke Inenaga
.
cpm 2022
:
[doi]
Bi-Directional r-Indexes
Yuma Arakawa
,
Gonzalo Navarro
,
Kunihiko Sadakane
.
cpm 2022
:
[doi]
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants
Yuichi Asahiro
,
Jesper Jansson 0001
,
Guohui Lin
,
Eiji Miyano
,
Hirotaka Ono
,
Tadatoshi Utashima
.
cpm 2022
:
[doi]
Back-To-Front Online Lyndon Forest Construction
Golnaz Badkobeh
,
Maxime Crochemore
,
Jonas Ellert
,
Cyril Nicaud
.
cpm 2022
:
[doi]
33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic
Hideo Bannai
,
Jan Holub 0001
, editors,
Volume 223 of
LIPIcs
, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022.
[doi]
The Fine-Grained Complexity of Episode Matching
Philip Bille
,
Inge Li Gørtz
,
Shay Mozes
,
Teresa Anna Steiner
,
Oren Weimann
.
cpm 2022
:
[doi]
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions
Laurent Bulteau
,
Mark Jones 0001
,
Rolf Niedermeier
,
Till Tantau
.
cpm 2022
:
[doi]
Permutation Pattern Matching for Doubly Partially Ordered Patterns
Laurent Bulteau
,
Guillaume Fertin
,
Vincent Jugé
,
Stéphane Vialette
.
cpm 2022
:
[doi]
Reordering a Tree According to an Order on Its Leaves
Laurent Bulteau
,
Philippe Gambette
,
Olga Seminck
.
cpm 2022
:
[doi]
A Theoretical and Experimental Analysis of BWT Variants for String Collections
Davide Cenzato
,
Zsuzsanna Lipták
.
cpm 2022
:
[doi]
Longest Palindromic Substring in Sublinear Time
Panagiotis Charalampopoulos
,
Solon P. Pissis
,
Jakub Radoszewski
.
cpm 2022
:
[doi]
The Dynamic k-Mismatch Problem
Raphaël Clifford
,
Pawel Gawrychowski
,
Tomasz Kociumaka
,
Daniel P. Martin 0001
,
Przemyslaw Uznanski
.
cpm 2022
:
[doi]
Linear-Time Computation of Shortest Covers of All Rotations of a String
Maxime Crochemore
,
Costas S. Iliopoulos
,
Jakub Radoszewski
,
Wojciech Rytter
,
Juliusz Straszynski
,
Tomasz Walen
,
Wiktor Zuba
.
cpm 2022
:
[doi]
Efficient Construction of the BWT for Repetitive Text Using String Compression
Diego Díaz-Domínguez
,
Gonzalo Navarro
.
cpm 2022
:
[doi]
The Normalized Edit Distance with Uniform Operation Costs Is a Metric
Dana Fisman
,
Joshua Grogin
,
Oded Margalit
,
Gera Weiss
.
cpm 2022
:
[doi]
Invitation to Combinatorial Reconfiguration (Invited Talk)
Takehiro Ito
.
cpm 2022
:
[doi]
Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations
Davaajav Jargalsaikhan
,
Diptarama Hendrian
,
Ryo Yoshinaka
,
Ayumi Shinohara
.
cpm 2022
:
[doi]
Reduction Ratio of the IS-Algorithm: Worst and Random Cases
Vincent Jugé
.
cpm 2022
:
[doi]
Beyond the Longest Letter-Duplicated Subsequence Problem
Wenfeng Lai
,
Adiesha Liyanage
,
Binhai Zhu
,
Peng Zou
.
cpm 2022
:
[doi]
Partial Permutations Comparison, Maintenance and Applications
Avivit Levy
,
Ely Porat
,
B. Riva Shalom
.
cpm 2022
:
[doi]
Mechanical Proving with Walnut for Squares and Cubes in Partial Words
John Machacek
.
cpm 2022
:
[doi]
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words
Takuya Mieno
,
Shunsuke Inenaga
,
Takashi Horiyama
.
cpm 2022
:
[doi]
Arbitrary-Length Analogs to de Bruijn Sequences
Abhinav Nellore
,
Rachel Ward
.
cpm 2022
:
[doi]
Cartesian Tree Subsequence Matching
Tsubasa Oizumi
,
Takeshi Kai
,
Takuya Mieno
,
Shunsuke Inenaga
,
Hiroki Arimura
.
cpm 2022
:
[doi]
Rectangular Tile Covers of 2D-Strings
Jakub Radoszewski
,
Wojciech Rytter
,
Juliusz Straszynski
,
Tomasz Walen
,
Wiktor Zuba
.
cpm 2022
:
[doi]
Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk)
Jeffrey O. Shallit
.
cpm 2022
:
[doi]
Compact Text Indexing for Advanced Pattern Matching Problems: Parameterized, Order-Isomorphic, 2D, etc. (Invited Talk)
Sharma V. Thankachan
.
cpm 2022
:
[doi]
2021
Computing Edit Distance (Invited Talk)
Michal Koucký 0001
.
cpm 2021
:
[doi]
Data Structures for Categorical Path Counting Queries
Meng He 0001
,
Serikzhan Kazi
.
cpm 2021
:
[doi]
Constructing Strings Avoiding Forbidden Substrings
Giulia Bernardini 0001
,
Alberto Marchetti-Spaccamela
,
Solon P. Pissis
,
Leen Stougie
,
Michelle Sweering
.
cpm 2021
:
[doi]
Optimal Construction of Hierarchical Overlap Graphs
Shahbaz Khan 0004
.
cpm 2021
:
[doi]
Front Matter, Table of Contents, Preface, Conference Organization
cpm 2021
:
[doi]
Ranking Bracelets in Polynomial Time
Duncan Adamson
,
Vladimir V. Gusev
,
Igor Potapov
,
Argyrios Deligkas
.
cpm 2021
:
[doi]
The k-Mappability Problem Revisited
Amihood Amir
,
Itai Boneh
,
Eitan Kondratovsky
.
cpm 2021
:
[doi]
Internal Shortest Absent Word Queries
Golnaz Badkobeh
,
Panagiotis Charalampopoulos
,
Solon P. Pissis
.
cpm 2021
:
[doi]
Repetitions in Strings: A "Constant" Problem (Invited Talk)
Hideo Bannai
.
cpm 2021
:
[doi]
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time
Hideo Bannai
,
Juha Kärkkäinen
,
Dominik Köppl
,
Marcin Piatkowski
.
cpm 2021
:
[doi]
Weighted Ancestors in Suffix Trees Revisited
Djamal Belazzougui
,
Dmitry Kosolobov
,
Simon J. Puglisi
,
Rajeev Raman
.
cpm 2021
:
[doi]
Gapped Indexing for Consecutive Occurrences
Philip Bille
,
Inge Li Gørtz
,
Max Rishøj Pedersen
,
Teresa Anna Steiner
.
cpm 2021
:
[doi]
Disorders and Permutations
Laurent Bulteau
,
Samuele Giraudo
,
Stéphane Vialette
.
cpm 2021
:
[doi]
Computing Covers of 2D-Strings
Panagiotis Charalampopoulos
,
Jakub Radoszewski
,
Wojciech Rytter
,
Tomasz Walen
,
Wiktor Zuba
.
cpm 2021
:
[doi]
A Fast and Small Subsampled R-Index
Dustin Cobas
,
Travis Gagie
,
Gonzalo Navarro
.
cpm 2021
:
[doi]
The Longest Run Subsequence Problem: Further Complexity Results
Riccardo Dondi
,
Florian Sikora
.
cpm 2021
:
[doi]
32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland
Pawel Gawrychowski
,
Tatiana Starikovskaya
, editors,
Volume 191 of
LIPIcs
, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2021.
[doi]
Compressed Weighted de Bruijn Graphs
Giuseppe F. Italiano
,
Nicola Prezza
,
Blerina Sinaimeri
,
Rossano Venturini
.
cpm 2021
:
[doi]
A Compact Index for Cartesian Tree Matching
Sung-Hwan Kim
,
Hwan-Gue Cho
.
cpm 2021
:
[doi]
String Sanitization Under Edit Distance: Improved and Generalized
Takuya Mieno
,
Solon P. Pissis
,
Leen Stougie
,
Michelle Sweering
.
cpm 2021
:
[doi]
An Invertible Transform for Efficient String Matching in Labeled Digraphs
Abhinav Nellore
,
Austin Nguyen
,
Reid F. Thompson
.
cpm 2021
:
[doi]
R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded Space
Takaaki Nishimoto
,
Yasuo Tabei
.
cpm 2021
:
[doi]
A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs
Sangsoo Park
,
Sung Gwan Park
,
Bastien Cazaux
,
Kunsoo Park
,
Eric Rivals
.
cpm 2021
:
[doi]
On-Line Pattern Matching on D-Texts (Invited Talk)
Nadia Pisanti
.
cpm 2021
:
[doi]
Efficient Algorithms for Counting Gapped Palindromes
Andrei Popa
,
Alexandru Popa 0001
.
cpm 2021
:
[doi]
AWLCO: All-Window Length Co-Occurrence
Joshua Sobel
,
Noah Bertram
,
Chen Ding 0001
,
Fatemeh Nargesian
,
Daniel Gildea
.
cpm 2021
:
[doi]
Optimal Completion and Comparison of Incomplete Phylogenetic Trees Under Robinson-Foulds Distance
Keegan Yao
,
Mukul S. Bansal
.
cpm 2021
:
[doi]
2020
The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time
Shay Golan 0001
,
Tomasz Kociumaka
,
Tsvi Kopelowitz
,
Ely Porat
.
cpm 2020
:
[doi]
FM-Index Reveals the Reverse Suffix Array
Arnab Ganguly 0002
,
Daniel Gibney
,
Sahar Hooshmand
,
M. Oguzhan Külekci
,
Sharma V. Thankachan
.
cpm 2020
:
[doi]
Front Matter, Table of Contents, Preface, Conference Organization
cpm 2020
:
[doi]
Efficient Tree-Structured Categorical Retrieval
Djamal Belazzougui
,
Gregory Kucherov
.
cpm 2020
:
[doi]
Dynamic String Alignment
Panagiotis Charalampopoulos
,
Tomasz Kociumaka
,
Shay Mozes
.
cpm 2020
:
[doi]
Counting Distinct Patterns in Internal Dictionary Matching
Panagiotis Charalampopoulos
,
Tomasz Kociumaka
,
Manal Mohamed
,
Jakub Radoszewski
,
Wojciech Rytter
,
Juliusz Straszynski
,
Tomasz Walen
,
Wiktor Zuba
.
cpm 2020
:
[doi]
String Factorizations Under Various Collision Constraints
Niels Grüttemeier
,
Christian Komusiewicz
,
Nils Morawietz
,
Frank Sommer
.
cpm 2020
:
[doi]
Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk)
Thore Husfeldt
.
cpm 2020
:
[doi]
k-Approximate Quasiperiodicity under Hamming and Edit Distance
Aleksander Kedzierski
,
Jakub Radoszewski
.
cpm 2020
:
[doi]
Text Indexing and Searching in Sublinear Time
J. Ian Munro
,
Gonzalo Navarro
,
Yakov Nekrich
.
cpm 2020
:
[doi]
Chaining with Overlaps Revisited
Veli Mäkinen
,
Kristoffer Sahlin
.
cpm 2020
:
[doi]
Time-Space Tradeoffs for Finding a Long Common Substring
Stav Ben Nun
,
Shay Golan 0001
,
Tomasz Kociumaka
,
Matan Kraus
.
cpm 2020
:
[doi]
On Extensions of Maximal Repeats in Compressed Strings
Julian Pape-Lange
.
cpm 2020
:
[doi]
Approximating Text-To-Pattern Distance via Dimensionality Reduction
Przemyslaw Uznanski
.
cpm 2020
:
[doi]
Sign in
or
sign up
to see more results.