|
|
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 | Stav Ben-Nun, Shay Golan 0001, Tomasz Kociumaka, Matan Kraus |
Time-Space Tradeoffs for Finding a Long Common Substring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 5:1-5:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Przemyslaw Uznanski |
Approximating Text-To-Pattern Distance via Dimensionality Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 29:1-29:11, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau |
On Indeterminate Strings Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 14:1-14:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Inge Li Gørtz, Oren Weimann (eds.) |
31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8 The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
1 | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara |
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 12:1-12:11, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa |
Finding the Anticover of a String. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 2:1-2:11, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Patty Commins, David Liben-Nowell, Tina Liu, Kiran Tomlinson |
Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 11:1-11:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shay Golan 0001, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat |
The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 15:1-15:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Thore Husfeldt |
Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 1:1-1:1, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Aleksander Kedzierski, Jakub Radoszewski |
k-Approximate Quasiperiodicity under Hamming and Edit Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 18:1-18:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara |
In-Place Bijective Burrows-Wheeler Transforms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 21:1-21:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Arnab Ganguly 0002, Daniel Gibney, Sahar Hooshmand, M. Oguzhan Külekci, Sharma V. Thankachan |
FM-Index Reveals the Reverse Suffix Array. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 13:1-13:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Djamal Belazzougui, Gregory Kucherov |
Efficient Tree-Structured Categorical Retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 4:1-4:11, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Evangelos Kipouridis, Kostas Tsichlas |
Longest Common Subsequence on Weighted Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 19:1-19:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | J. Ian Munro, Gonzalo Navarro 0001, Yakov Nekrich |
Text Indexing and Searching in Sublinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 24:1-24:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Julian Pape-Lange |
On Extensions of Maximal Repeats in Compressed Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 27:1-27:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Panagiotis Charalampopoulos, Tomasz Kociumaka, Shay Mozes |
Dynamic String Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 9:1-9:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Takaaki Nishimoto, Yasuo Tabei |
Conversion from RLBWT to LZ77. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 9:1-9:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Michal Ziv-Ukelson |
Stringology Combats Microbiological Threats (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 3:1-3:1, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park |
Cartesian Tree Matching and Indexing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 16:1-16:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Djamal Belazzougui, Fabio Cunial |
Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 10:1-10:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Nicola Prezza, Giovanna Rosone |
Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 7:1-7:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Julian Pape-Lange |
On Maximal Repeats in Compressed Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 18:1-18:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ali Akhavi, Julien Clément 0001, Dimitri Darthenay, Loïck Lhote, Brigitte Vallée |
Dichotomic Selection on Words: A Probabilistic Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 19:1-19:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Nadia Pisanti, Solon P. Pissis (eds.) |
30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0 The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
1 | Raffaele Giancarlo, Giovanni Manzini, Giovanna Rosone, Marinella Sciortino |
A New Class of Searchable and Provably Highly Compressible String Transformations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 12:1-12:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Giulia Bernardini 0001, Paola Bonizzoni, Gianluca Della Vedova, Murray Patterson |
A Rearrangement Distance for Fully-Labelled Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 28:1-28:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski |
Indexing the Bijective BWT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 17:1-17:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Gawrychowski, Tatiana Starikovskaya |
Streaming Dictionary Matching with Mismatches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 21:1-21:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, Simon J. Puglisi |
Computing the Antiperiod(s) of a String. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 32:1-32:11, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Karim Labib, Przemyslaw Uznanski, Daniel Wolleb-Graf |
Hamming Distance Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 14:1-14:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Oleg Merkurev, Arseny M. Shur |
Searching Long Repeats in Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 31:1-31:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Haitao Jiang, Jiong Guo, Daming Zhu, Binhai Zhu |
A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 5:1-5:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Francesco Dolce, Antonio Restivo, Christophe Reutenauer |
Some Variations on Lyndon Words (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 2:1-2:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Niko Kiirala, Leena Salmela, Alexandru I. Tomescu |
Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 8:1-8:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 25:1-25:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Computing Runs on a Trie. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 23:1-23:11, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 0:1-0:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 29:1-29:11, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Diego Díaz-Domínguez, Travis Gagie, Gonzalo Navarro 0001 |
Simulating the DNA Overlap Graph in Succinct Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 26:1-26:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Amihood Amir, Eitan Kondratovsky |
Sufficient Conditions for Efficient Indexing Under Different Matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 6:1-6:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Faster Queries for Longest Substring Palindrome After Block Edit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 27:1-27:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Gawrychowski, Jakub Radoszewski, Tatiana Starikovskaya |
Quasi-Periodicity in Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 22:1-22:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson 0002, Daniël Paulusma, Stéphane Vialette |
Finding a Small Number of Colourful Components. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 20:1-20:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Dmitry Kosolobov, Nikita Sivukhin |
Compressed Multiple Pattern Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 13:1-13:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga |
Online Algorithms for Constructing Linear-Size Suffix Trie. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 30:1-30:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Bastien Cazaux, Eric Rivals |
Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 24:1-24:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Jan Studený, Przemyslaw Uznanski |
Approximating Approximate Pattern Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 15:1-15:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Gawrychowski |
How to Exploit Periodicity (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 1:1-1:1, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Michal Ganczorz |
Entropy Lower Bounds for Dictionary Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 11:1-11:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Nicola Prezza |
Optimal Rank and Select Queries on Dictionary-Compressed Text. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy., pp. 4:1-4:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-103-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Shu Zhang 0005, Daming Zhu, Haitao Jiang, Jingjing Ma, Jiong Guo, Haodi Feng |
Can a permutation be sorted by best short swaps?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 14:1-14:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Lyndon Factorization of Grammar Compressed Texts Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 24:1-24:10, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Brian Brubach, Jay Ghurye |
A Succinct Four Russians Speedup for Edit Distance Computation and One-against-many Banded Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 13:1-13:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Paniz Abedin, Sahar Hooshmand, Arnab Ganguly 0002, Sharma V. Thankachan |
The Heaviest Induced Ancestors Problem Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 20:1-20:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Tatsuya Akutsu, Colin de la Higuera, Takeyuki Tamura |
A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 10:1-10:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Bastien Cazaux, Eric Rivals |
Superstrings with multiplicities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 21:1-21:16, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Yoshifumi Sakai |
Maximal Common Subsequence Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 1:1-1:10, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Hideo Bannai, Travis Gagie, Tomohiro I |
Online LZ77 Parsing and Matching Statistics with RLBWTs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 7:1-7:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Rayan Chikhi, Alexander Schönhuth |
Dualities in Tree Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 18:1-18:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Longest substring palindrome after edit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 12:1-12:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Longest Lyndon Substring After Edit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 19:1-19:10, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Kilho Shin, Taichi Ishikawa |
Linear-time algorithms for the subpath kernel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 22:1-22:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Brian Brubach |
Fast Matching-based Approximations for Maximum Duo-Preservation String Mapping and its Weighted Variant. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 5:1-5:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 0:1-0:16, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Bartlomiej Dudek 0001, Pawel Gawrychowski |
Slowing Down Top Trees for Better Worst-Case Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 16:1-16:8, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Sahar Hooshmand, Paniz Abedin, M. Oguzhan Külekci, Sharma V. Thankachan |
Non-Overlapping Indexing - Cache Obliviously. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 8:1-8:9, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Gonzalo Navarro 0001, David Sankoff, Binhai Zhu (eds.) |
Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3 The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
1 | Amihood Amir, Itai Boneh |
Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 11:1-11:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Guillaume Fertin, Julien Fradin, Christian Komusiewicz |
On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 17:1-17:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Faster Online Elastic Degenerate String Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 9:1-9:10, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Amihood Amir, Avivit Levy, Ely Porat |
Quasi-Periodicity Under Mismatch Errors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 4:1-4:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
Linear-Time Algorithm for Long LCF with k Mismatches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 23:1-23:16, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Uwe Baier |
On Undetected Redundancy in the Burrows-Wheeler Transform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 3:1-3:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Guillaume Blin, Alexandre Blondin Massé, Marie Gasparoux, Sylvie Hamel, Élise Vandomme |
Nearest constrained circular words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 6:1-6:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda |
Computing longest common square subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 15:1-15:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Rui Henriques, Alexandre P. Francisco, Luís M. S. Russo, Hideo Bannai |
Order-Preserving Pattern Matching Indeterminate Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China, pp. 2:1-2:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-074-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Tomohiro I |
Longest Common Extensions with Recompression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 18:1-18:15, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Bartlomiej Dudek 0001, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja |
A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 10:1-10:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Luís Felipe I. Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis Antonio Brasil Kowada, Jens Stoye |
Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 19:1-19:9, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Giulio Ermanno Pibiri, Rossano Venturini |
Dynamic Elias-Fano Representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 30:1-30:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 0:i-0:xvi, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Hideo Bannai, Shunsuke Inenaga, Dominik Köppl |
Computing All Distinct Squares in Linear Time for Integer Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 22:1-22:18, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Gonzalo Navarro 0001 |
Document Listing on Repetitive Collections with Guaranteed Performance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 4:1-4:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz |
Beyond Adjacency Maximization: Scaffold Filling for New String Distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 27:1-27:17, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Tatiana Starikovskaya |
Communication and Streaming Complexity of Approximate Pattern Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 13:1-13:11, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Roberto Grossi, Costas S. Iliopoulos, Chang Liu 0035, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari |
On-Line Pattern Matching on Similar Texts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 9:1-9:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Manuel Lafond, Céline Scornavacca |
On the Weighted Quartet Consensus Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 28:1-28:18, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat |
Approximate Cover of Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 26:1-26:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur |
Palindromic Length in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 23:1-23:12, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter (eds.) |
28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2 The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
1 | Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Tight Bounds on the Maximum Number of Shortest Unique Substrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 24:1-24:11, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Karl Bringmann, Philip Wellnitz |
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 12:1-12:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara |
Position Heaps for Parameterized Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 8:1-8:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis |
The Longest Filled Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 14:1-14:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Giovanni Manzini |
Wheeler Graphs: Variations on a Theme by Burrows and Wheeler. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 1:1-1:1, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Philip Bille, Patrick Hagge Cording, Johannes Fischer 0001, Inge Li Gørtz |
Lempel-Ziv Compression in a Sliding Window. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 15:1-15:11, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Philippe Duchon, Cyril Nicaud, Carine Pivoteau |
Gapped Pattern Statistics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 21:1-21:12, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Djamal Belazzougui, Fabio Cunial |
Representing the Suffix Tree with the CDAWG. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 7:1-7:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen |
Deterministic Indexing for Packed Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland, pp. 6:1-6:11, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-039-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 952 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|