|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 83 occurrences of 70 keywords
|
|
|
|
|
Results
Found 952 publication records. Showing 952 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gonzalo Navarro 0001, Cristian Urbina |
L-Systems for Measuring Repetitiveness.  |
CPM  |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno |
Optimal LZ-End Parsing Is Hard. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Gene Myers |
Merging Sorted Lists of Similar Strings. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Köppl |
Encoding Hard String Problems with Answer Set Programming. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriele Fici, Giuseppe Romana, Marinella Sciortino, Cristian Urbina |
On the Impact of Morphisms on BWT-Runs. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Charalampopoulos, Bartlomiej Dudek 0001, Pawel Gawrychowski, Karol Pokorski |
Optimal Near-Linear Space Heaviest Induced Ancestors. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson 0001, Guohui Lin, Eiji Miyano, Hirotaka Ono 0001, Shunichi Tanaka |
Approximation Algorithms for the Longest Run Subsequence Problem. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Grigorios Loukides, Solon P. Pissis, Sharma V. Thankachan, Wiktor Zuba |
Suffix-Prefix Queries on a Dictionary. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Cáceres |
Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Bourhis, Aaron Boussidan, Philippe Gambette |
On Distances Between Words with Parameters. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Massimo Equi, Arianne Meijer-van de Griend, Veli Mäkinen |
From Bit-Parallelism to Quantum String Matching for Labelled Graphs. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung-Hwan Kim, Francisco Olivares, Nicola Prezza |
Faster Prefix-Sorting Algorithms for Deterministic Finite Automata. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner |
Compressed Indexing for Consecutive Occurrences. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Tatarnikov, Ardavan Shahrabi Farahani, Sana Kashgouli, Travis Gagie |
MONI Can Find k-MEMs. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Arroyuelo, Juan Pablo Castillo |
Trie-Compressed Adaptive Set Intersection. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau |
Order-Preserving Squares in Strings. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Zsuzsanna Lipták (eds.) |
34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France |
CPM |
2023 |
DBLP BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Kucherov, Steven Skiena |
Improving the Sensitivity of MinHash Through Hash-Value Analysis. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Johannes Fischer 0001, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen |
Sliding Window String Indexing in Streams. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinya Nagashita, Tomohiro I |
PalFM-Index: FM-Index for Palindrome Pattern Matching. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag |
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson 0001, Zara Lim, Wing-Kin Sung |
MUL-Tree Pruning for Consistency and Compatibility. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Matan Kraus, Moshe Lewenstein, Alexandru Popa 0001, Ely Porat, Yonathan Sadia |
String Factorization via Prefix Free Families. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Gonzalo Navarro 0001 |
Computing MEMs on Repetitive Text Collections. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Itai Boneh, Dvir Fried, Adrian Miclaus, Alexandru Popa 0001 |
Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Estéban Gabory, Njagi Moses Mwaniki, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski, Michelle Sweering, Wiktor Zuba |
Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications. |
CPM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura |
Cartesian Tree Subsequence Matching. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Rizzo 0001, Veli Mäkinen |
Indexable Elastic Founder Graphs of Minimum Height. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Díaz-Domínguez, Gonzalo Navarro 0001 |
Efficient Construction of the BWT for Repetitive Text Using String Compression. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski |
Longest Palindromic Substring in Sublinear Time. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette |
Permutation Pattern Matching for Doubly Partially Ordered Patterns. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
Rectangular Tile Covers of 2D-Strings. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhinav Nellore, Rachel A. Ward |
Arbitrary-Length Analogs to de Bruijn Sequences. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou |
Beyond the Longest Letter-Duplicated Subsequence Problem. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Jesper Jansson 0001, Guohui Lin, Eiji Miyano, Hirotaka Ono 0001, Tadatoshi Utashima |
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin 0001, Przemyslaw Uznanski |
The Dynamic k-Mismatch Problem. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Giulia Bernardini 0001, Alessio Conte, Estéban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering |
On Strings Having the Same Length- k Substrings. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Mark Jones 0001, Rolf Niedermeier, Till Tantau |
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Fisman, Joshua Grogin, Oded Margalit, Gera Weiss |
The Normalized Edit Distance with Uniform Operation Costs Is a Metric. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
Linear-Time Computation of Shortest Covers of All Rotations of a String. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuma Arakawa, Gonzalo Navarro 0001, Kunihiko Sadakane |
Bi-Directional r-Indexes. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Avivit Levy, Ely Porat, B. Riva Shalom |
Partial Permutations Comparison, Maintenance and Applications. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann |
The Fine-Grained Complexity of Episode Matching. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud |
Back-To-Front Online Lyndon Forest Construction. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Jugé |
Reduction Ratio of the IS-Algorithm: Worst and Random Cases. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito |
Invitation to Combinatorial Reconfiguration (Invited Talk). |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Giulia Bernardini 0001, Huiping Chen, Grigorios Loukides, Solon P. Pissis, Leen Stougie, Michelle Sweering |
Making de Bruijn Graphs Eulerian. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Cenzato, Zsuzsanna Lipták |
A Theoretical and Experimental Analysis of BWT Variants for String Collections. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hideo Bannai, Jan Holub 0001 (eds.) |
33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic. |
CPM |
2022 |
DBLP BibTeX RDF |
|
| 1 | John M. Machacek |
Mechanical Proving with Walnut for Squares and Cubes in Partial Words. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeffrey O. Shallit |
Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk). |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sharma V. Thankachan |
Compact Text Indexing for Advanced Pattern Matching Problems: Parameterized, Order-Isomorphic, 2D, etc. (Invited Talk). |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Philippe Gambette, Olga Seminck |
Reordering a Tree According to an Order on Its Leaves. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga |
Minimal Absent Words on Run-Length Encoded Strings. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama |
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. |
CPM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Pisanti |
On-Line Pattern Matching on D-Texts (Invited Talk). |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Golnaz Badkobeh, Panagiotis Charalampopoulos, Solon P. Pissis |
Internal Shortest Absent Word Queries. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Dustin Cobas, Travis Gagie, Gonzalo Navarro 0001 |
A Fast and Small Subsampled R-Index. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski |
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals |
A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhinav Nellore, Austin Nguyen, Reid F. Thompson |
An Invertible Transform for Efficient String Matching in Labeled Digraphs. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Sobel, Noah Bertram, Chen Ding 0001, Fatemeh Nargesian, Daniel Gildea |
AWLCO: All-Window Length Co-Occurrence. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Keegan Yao, Mukul S. Bansal |
Optimal Completion and Comparison of Incomplete Phylogenetic Trees Under Robinson-Foulds Distance. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini |
Compressed Weighted de Bruijn Graphs. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Duncan Adamson, Vladimir V. Gusev, Igor Potapov, Argyrios Deligkas |
Ranking Bracelets in Polynomial Time. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei Popa, Alexandru Popa 0001 |
Efficient Algorithms for Counting Gapped Palindromes. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Itai Boneh, Eitan Kondratovsky |
The k-Mappability Problem Revisited. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Shahbaz Khan 0004 |
Optimal Construction of Hierarchical Overlap Graphs. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Hideo Bannai |
Repetitions in Strings: A "Constant" Problem (Invited Talk). |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Koucký 0001 |
Computing Edit Distance (Invited Talk). |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner |
Gapped Indexing for Consecutive Occurrences. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sung-Hwan Kim, Hwan-Gue Cho |
A Compact Index for Cartesian Tree Matching. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
Computing Covers of 2D-Strings. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Tatiana Starikovskaya (eds.) |
32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland. |
CPM |
2021 |
DBLP BibTeX RDF |
|
| 1 | Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering |
String Sanitization Under Edit Distance: Improved and Generalized. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Takaaki Nishimoto, Yasuo Tabei |
R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded Space. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Giulia Bernardini 0001, Alberto Marchetti-Spaccamela, Solon P. Pissis, Leen Stougie, Michelle Sweering |
Constructing Strings Avoiding Forbidden Substrings. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Samuele Giraudo, Stéphane Vialette |
Disorders and Permutations. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Riccardo Dondi, Florian Sikora |
The Longest Run Subsequence Problem: Further Complexity Results. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Meng He 0001, Serikzhan Kazi |
Data Structures for Categorical Path Counting Queries. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman |
Weighted Ancestors in Suffix Trees Revisited. |
CPM |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathan Schaar, Vincent Froese, Rolf Niedermeier |
Faster Binary Mean Computation Under Dynamic Time Warping. |
CPM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita |
Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP. |
CPM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol |
Double String Tandem Repeats. |
CPM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Giulia Bernardini 0001, Paola Bonizzoni, Pawel Gawrychowski |
On Two Measures of Distance Between Fully-Labelled Trees. |
CPM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Lafond, Binhai Zhu, Peng Zou |
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms. |
CPM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed 0001, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
Counting Distinct Patterns in Internal Dictionary Matching. |
CPM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
CPM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
String Factorizations Under Various Collision Constraints. |
CPM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda |
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. |
CPM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Giulia Bernardini 0001, Huiping Chen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Leen Stougie, Michelle Sweering |
String Sanitization Under Edit Distance. |
CPM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Veli Mäkinen, Kristoffer Sahlin |
Chaining with Overlaps Revisited. |
CPM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomohiro Koana, Vincent Froese, Rolf Niedermeier |
Parameterized Algorithms for Matrix Completion with Radius Constraints. |
CPM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya |
Approximating Longest Common Substring with k mismatches: Theory and Practice. |
CPM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Wiktor Zuba |
Unary Words Have the Smallest Levenshtein k-Neighbourhoods. |
CPM |
2020 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 952 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license