CPM - RankMe – RankMe

31 papers

Year	Title / Authors
2020	31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, Copenhagen, Denmark, June 17-19, 2020 Inge Li Gørtz, Oren Weimann
2020	Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk). Thore Husfeldt
2020	Approximating Longest Common Substring with k mismatches: Theory and Practice. Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya
2020	Approximating Text-To-Pattern Distance via Dimensionality Reduction. Przemyslaw Uznanski
2020	Chaining with Overlaps Revisited. Veli Mäkinen, Kristoffer Sahlin
2020	Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP. Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita
2020	Counting Distinct Patterns in Internal Dictionary Matching. Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
2020	DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
2020	Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
2020	Double String Tandem Repeats. Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol
2020	Dynamic String Alignment. Panagiotis Charalampopoulos, Tomasz Kociumaka, Shay Mozes
2020	Efficient Tree-Structured Categorical Retrieval. Djamal Belazzougui, Gregory Kucherov
2020	FM-Index Reveals the Reverse Suffix Array. Arnab Ganguly, Daniel Gibney, Sahar Hooshmand, M. Oguzhan Külekci, Sharma V. Thankachan
2020	Faster Binary Mean Computation Under Dynamic Time Warping. Nathan Schaar, Vincent Froese, Rolf Niedermeier
2020	Finding the Anticover of a String. Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa
2020	Front Matter, Table of Contents, Preface, Conference Organization.
2020	Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms. Manuel Lafond, Binhai Zhu, Peng Zou
2020	In-Place Bijective Burrows-Wheeler Transforms. Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara
2020	Longest Common Subsequence on Weighted Sequences. Evangelos Kipouridis, Kostas Tsichlas
2020	On Extensions of Maximal Repeats in Compressed Strings. Julian Pape-Lange
2020	On Indeterminate Strings Matching. Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau
2020	On Two Measures of Distance Between Fully-Labelled Trees. Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski
2020	Parameterized Algorithms for Matrix Completion with Radius Constraints. Tomohiro Koana, Vincent Froese, Rolf Niedermeier
2020	String Factorizations Under Various Collision Constraints. Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2020	String Sanitization Under Edit Distance. Giulia Bernardini, Huiping Chen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Leen Stougie, Michelle Sweering
2020	Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions. Patty Commins, David Liben-Nowell, Tina Liu, Kiran Tomlinson
2020	Text Indexing and Searching in Sublinear Time. J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2020	The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
2020	Time-Space Tradeoffs for Finding a Long Common Substring. Stav Ben-Nun, Shay Golan, Tomasz Kociumaka, Matan Kraus
2020	Unary Words Have the Smallest Levenshtein k-Neighbourhoods. Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Wiktor Zuba
2020	k-Approximate Quasiperiodicity under Hamming and Edit Distance. Aleksander Kedzierski, Jakub Radoszewski