| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Tatiana A. Starikovskaya, Hjalte Wedel Vildhøj |
Time-Space Trade-Offs for the Longest Common Substring Problem.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan |
Space-Efficient Construction Algorithm for the Circular Suffix Tree.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez |
Approximation of Grammar-Based Compression via Recompression.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Lewenstein |
LCP Magic.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Patrick Hagge Cording, Inge Li Gørtz |
Compact q-Gram Profiling of Compressed Strings.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Verbin, Wei Yu |
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan |
Forty Years of Text Indexing.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiong Guo, Danny Hermelin, Christian Komusiewicz |
Local Search for String Problems: Brute Force Is Essentially Optimal.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Markus L. Schmid |
Pattern Matching with Variables: A Multivariate Complexity Analysis.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
Fast Algorithm for Partial Covers in Words.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin |
Approximating Shortest Superstring Problem Using de Bruijn Graphs.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Gary Benson, Yozen Hernandez, Joshua Loving |
A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Felipe Alves da Louza, Guilherme P. Telles, Cristina Dutra de Aguiar Ciferri |
External Memory Generalized Suffix and LCP Arrays Construction.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxim A. Babenko, Ignat I. Kolesnichenko, Tatiana A. Starikovskaya |
On Minimal and Maximal Suffixes of a Substring.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Fischer, Peter Sanders (eds.) |
Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Efficient Lyndon Factorization of Grammar Compressed Text.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Gene Myers |
Discrete Methods for Image Analysis Applied to Molecular Biology.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda |
Converting SLP to LZ78 in almost Linear Time.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau |
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson |
Efficient All Path Score Computations on Grid Graphs.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Travis Gagie, Wing-Kai Hon, Tsung-Han Ku |
New Algorithms for Position Heaps.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Yasuo Tabei, Yoshimasa Takabatake, Hiroshi Sakamoto |
A Succinct Grammar Compression.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Mika Amit, Maxime Crochemore, Gad M. Landau |
Locating All Maximal Approximate Runs in a String.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi |
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Travis Gagie, Kalle Karhu, Gonzalo Navarro, Simon J. Puglisi, Jouni Sirén |
Document Listing on Repetitive Collections.  |
CPM  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Juha Kärkkäinen, Jens Stoye (eds.) |
Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Condon, Ján Manuch, Chris Thachuk |
The Complexity of String Partitioning.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette |
Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael P. Ferguson |
FEMTO: Fast Search of Large Sequence Collections.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Omar AitMous, Frédérique Bassino, Cyril Nicaud |
An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Leszek Gasieniec, Roberto Grossi |
Constant-Time Word-Size String Matching.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Liviu Petrisor Dinu, Alexandru Popa |
On the Closest String via Rank Distance.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann |
On Approximating String Selection Problems with Outliers.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Niko Välimäki |
Least Random Suffix/Prefix Matches in Output-Sensitive Time.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau, Mathias Möhl, Christina Schmiedl, Sebastian Will |
Local Exact Pattern Matching for Non-fixed RNA Structures.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Haitao Jiang, Binhai Zhu |
A Linear Kernel for the Complementary Maximal Strip Recovery Problem.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan |
Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda |
Computing the Burrows-Wheeler Transform of a String and Its Reverse.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Djamal Belazzougui, Rossano Venturini |
Compressed String Dictionary Look-Up with Edit Distance One.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Aïda Ouangraoua, Mathieu Raffinot |
Faster and Simpler Minimal Conflicting Set Identification - (Extended Abstract).  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Andrzej Lingas |
Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Kucherov, Yakov Nekrich, Tatiana A. Starikovskaya |
Cross-Document Pattern Matching.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster |
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann |
Partitioning into Colorful Components by Minimum Edge Deletions.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gonzalo Navarro |
Wavelet Trees for All.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Hundt, Florian Wendland |
Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen |
The Maximum Number of Squares in a Tree.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter |
Document Listing for Queries with Excluded Pattern.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski |
Simple and Efficient LZW-Compressed Multiple Pattern Matching.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
Speeding Up q-Gram Mining on Grammar-Based Compressed Texts.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhi-Zhong Chen, Lusheng Wang, Wenji Ma |
The Parameterized Complexity of the Shared Center Problem.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu |
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Riccardo Dondi, Nadia El-Mabrouk |
Minimum Leaf Removal for Reconciliation: Complexity and Algorithms.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Shamir |
Gene Regulation, Protein Networks and Disease: A Computational Perspective.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yen Kaow Ng, Hirotaka Ono, Ling Ge, Shuai Cheng Li |
Finding Longest Common Segments in Protein Structures in Nearly Linear Time.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Saad Sheikh, Rolf Backofen, Yann Ponty |
Impact of the Energy Model on the Complexity of RNA Folding with Pseudoknots.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach |
Pattern Matching in Multiple Streams.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wing-Kai Hon, Tsung-Han Ku, Chen-Hua Lu, Rahul Shah, Sharma V. Thankachan |
Efficient Algorithm for Circular Burrows-Wheeler Transform.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj |
Time-Space Trade-Offs for Longest Common Extensions.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | David Fernández-Baca, Sylvain Guillemot, Brad Shutters, Sudheer Vakati |
Fixed-Parameter Algorithms for Finding Agreement Supertrees.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dima Blokh, Danny Segev, Roded Sharan |
Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations.  |
CPM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Juraj Stacho |
Unique Perfect Phylogeny Is NP-Hard.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamar Pinhas, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson |
Edit Distance with Duplications and Contractions Revisited.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Enno Ohlebusch, Simon Gog |
Lempel-Ziv Factorization Revisited.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Zvi Galil |
Real-Time Streaming String-Matching.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kouichi Hirata, Yoshiyuki Yamamoto, Tetsuji Kuboyama |
Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David E. Daykin, Jacqueline W. Daykin, William F. Smyth |
String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nello Cristianini |
Automatic Discovery of Patterns in Media Content.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Thachuk |
Succincter Text Indexing with Wildcards.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ferragina |
On the Weak Prefix-Search Problem.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Nielsen |
A Coarse-to-Fine Approach to Computing the k-Best Viterbi Paths.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémy Barbay, Johannes Fischer, Gonzalo Navarro |
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomohiro I, Shunsuke Inenaga, Masayuki Takeda |
Palindrome Pattern Matching.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Giancarlo, Giovanni Manzini (eds.) |
Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Isaac Goldstein, Moshe Lewenstein |
Quick Greedy Computation for Minimum Common String Partitions.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Takashi Uemura, Hiroki Arimura |
Sparse and Truncated Suffix Trees on Variable-Length Codes.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Domenico Cantone, Salvatore Cristofaro, Simone Faro |
Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa |
Restricted Common Superstring and Restricted Common Supersequence.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Haitao Jiang, Farong Zhong, Binhai Zhu |
Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Vingron |
Computational Regulatory Genomics.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gad M. Landau |
Algorithms on Grammar-Compressed Strings.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Gosselin, Guillaume Damiand, Christine Solnon |
Frequent Submap Discovery.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Riccardo Dondi, Guillaume Fertin, Stéphane Vialette |
Finding Approximate and Constrained Motifs in Graphs.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Roberto Grossi, Filippo Mignosi |
Simple Real-Time Constant-Space String Matching.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefanie Schirmer, Robert Giegerich |
Forest Alignment with Affine Gaps and Anchors.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Antoine Deza, Frantisek Franek, Mei Jiang |
A d-Step Approach for Distinct Squares in Strings.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan |
Approximation Algorithms for Orienting Mixed Graphs.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | German Tischler |
On Wavelet Tree Construction.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Travis Gagie, Juha Kärkkäinen |
Counting Colours in Compressed Strings.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Otto, Peter F. Stadler, Sonja J. Prohaska |
Phylogenetic Footprinting and Consistent Sets of Local Aligments.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus J. Bauer, Anthony J. Cox, Giovanna Rosone |
Lightweight BWT Construction for Very Large String Collections.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu |
Tractability and Approximability of Maximal Strip Recovery.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz |
Substring Range Reporting.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yassin Refahi, Etienne Farcot, Yann Guédon, Fabrice Besnard, Teva Vernoux, Christophe Godin |
A Combinatorial Model of Phyllotaxis Perturbations in Arabidopsis thaliana.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach |
Space Lower Bounds for Online Pattern Matching.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Gregory Brown, Jakub Truszkowski |
Fast Error-Tolerant Quartet Phylogeny Algorithms.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Kreft, Gonzalo Navarro |
Self-indexing Based on LZ77.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen |
Efficient Seeds Computation Revisited.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
Polynomial-Time Approximation Algorithms for Weighted LCS Problem.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|