| Finding patterns and periods in Cartesian tree matching. | 0 | 0.34 | 2020 |
| Double String Tandem Repeats. | 0 | 0.34 | 2020 |
| On Indeterminate Strings Matching. | 0 | 0.34 | 2020 |
| Finding Periods in Cartesian Tree Matching. | 0 | 0.34 | 2019 |
| Cartesian Tree Matching and Indexing. | 0 | 0.34 | 2019 |
| Fast entropy-bounded string dictionary look-up with mismatches. | 0 | 0.34 | 2018 |
| EDoP Distance Between Sets of Incomplete Permutations: Application to Bacteria Classification Based on Gene Order. | 0 | 0.34 | 2018 |
| Two-dimensional maximal repetitions. | 1 | 0.35 | 2018 |
| Period recovery of strings over the Hamming and edit distances. | 2 | 0.39 | 2018 |
| The Nearest Colored Node in a Tree. | 0 | 0.34 | 2018 |
| A Faster Construction of Phylogenetic Consensus Trees. | 0 | 0.34 | 2017 |
| String Cadences. | 0 | 0.34 | 2017 |
| Locating maximal approximate runs in a string. | 2 | 0.39 | 2017 |
| Period Recovery over the Hamming and Edit Distances. | 1 | 0.35 | 2016 |
| Sequence similarity measures based on bounded hamming distance. | 8 | 0.51 | 2016 |
| Range Minimum Query Indexes in Higher Dimensions | 0 | 0.34 | 2015 |
| Random Access to Grammar-Compressed Strings and Trees | 20 | 0.76 | 2015 |
| Computing the Burrows-Wheeler transform in place and in small space | 2 | 0.39 | 2015 |
| On Cartesian Trees and Range Minimum Queries | 30 | 1.04 | 2014 |
| Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings. | 0 | 0.34 | 2014 |
| ExpaRNA-P: simultaneous exact pattern matching and folding of RNAs. | 10 | 0.44 | 2014 |
| Binary Jumbled Pattern Matching via All-Pairs Shortest Paths. | 10 | 0.63 | 2014 |
| Local Exact Pattern Matching for Non-FixedRNA Structures. | 0 | 0.34 | 2014 |
| Longest Common Extensions in Trees. | 0 | 0.34 | 2014 |
| A Constant-Space Comparison-Based Algorithm For Computing The Burrows-Wheeler Transform | 8 | 0.55 | 2013 |
| Unified Compression-Based Acceleration of Edit-Distance Computation | 10 | 0.52 | 2013 |
| Binary Jumbled Pattern Matching on Trees and Tree-Like Structures | 13 | 0.72 | 2013 |
| Tree compression with top trees | 3 | 0.39 | 2013 |
| Exact pattern matching for RNA structure ensembles | 4 | 0.40 | 2012 |
| An efficient algorithm to test square-freeness of strings compressed by straight-line programs | 5 | 0.54 | 2012 |
| Local exact pattern matching for non-fixed RNA structures | 1 | 0.36 | 2012 |
| Detecting approximate periodic patterns | 0 | 0.34 | 2012 |
| Haplotype Inference Constrained by Plausible Haplotype Data | 2 | 0.38 | 2011 |
| Fast Computation of a String Duplication History under No-Breakpoint-Reuse - (Extended Abstract). | 0 | 0.34 | 2011 |
| Random access to grammar-compressed strings | 24 | 0.73 | 2011 |
| Algorithms on grammar-compressed strings | 0 | 0.34 | 2011 |
| Range LCP. | 1 | 0.36 | 2011 |
| Fast RNA structure alignment for crossing input structures | 6 | 0.46 | 2011 |
| Efficient algorithms for consensus string problems minimizing both distance sum and radius | 4 | 0.42 | 2011 |
| A PTAS for the Square Tiling Problem. | 1 | 0.36 | 2010 |
| Consensus Optimizing Both Distance Sum and Radius | 6 | 0.44 | 2009 |
| Interchange rearrangement: The element-cost model | 6 | 0.60 | 2009 |
| Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings | 22 | 1.83 | 2008 |
| Conservative String Covering Of Indeterminate Strings | 4 | 0.43 | 2008 |
| Computing similarity of run-length encoded strings with affine gap penalty | 3 | 0.39 | 2008 |
| Approximating the 2-interval pattern problem | 11 | 0.62 | 2008 |
| Optimal spaced seeds for faster approximate string matching | 13 | 0.60 | 2007 |
| Locality and gaps in RNA comparison. | 7 | 0.47 | 2007 |
| Dynamic text and static pattern matching | 32 | 1.23 | 2007 |
| Indexing a dictionary for subset matching queries | 1 | 0.37 | 2007 |
