String Cadences. | 0 | 0.34 | 2017 |
40 years of suffix trees. | 3 | 0.53 | 2016 |
Sequence similarity measures based on bounded hamming distance. | 8 | 0.51 | 2016 |
Modulated string searching | 0 | 0.34 | 2014 |
Alignment Free Sequence Similarity with Bounded Hamming Distance | 7 | 0.49 | 2014 |
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings. | 0 | 0.34 | 2014 |
Forty Years Of Text Indexing | 1 | 0.36 | 2013 |
Ultrametric networks: a new tool for phylogenetic analysis. | 3 | 0.49 | 2013 |
Parameterized searching with mismatches for run-length encoded strings | 2 | 0.37 | 2012 |
Detecting approximate periodic patterns | 0 | 0.34 | 2012 |
Phylogeny construction with rigid gapped motifs. | 3 | 0.42 | 2012 |
Efficient algorithms for the periodic subgraphs mining problem | 0 | 0.34 | 2012 |
Structure Discovery in Biology: Motifs, Networks & Phylogenies (Dagstuhl Seminar 12291). | 0 | 0.34 | 2012 |
Range LCP. | 1 | 0.36 | 2011 |
Image Compression by 2D Motif Basis | 4 | 0.37 | 2011 |
Speedup for a periodic subgraph miner | 4 | 0.51 | 2011 |
Sequence Similarity by Gapped LZW | 2 | 0.40 | 2011 |
Efficient algorithms for the discovery of gapped factors. | 4 | 0.42 | 2011 |
Maximal words in sequence comparisons based on subword composition | 10 | 0.57 | 2010 |
A PTAS for the Square Tiling Problem. | 1 | 0.36 | 2010 |
VARUN: discovering extensible motifs under saturation constraints. | 17 | 0.66 | 2010 |
10231 Abstracts Collection - Structure Discovery in Biology: Motifs, Networks & Phylogenies. | 0 | 0.34 | 2010 |
Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract) | 0 | 0.34 | 2010 |
Optimal Extraction Of Irredundant Motif Bases | 2 | 0.39 | 2010 |
The subsequence composition of a string | 1 | 0.35 | 2009 |
Graph Compression By Bfs | 43 | 1.71 | 2009 |
Discovering subword associations in strings in time linear in the output size | 3 | 0.39 | 2009 |
Ask Not What Stringology Can Do for You: Advances in Pattern Matching Driven by Computational Biology | 0 | 0.34 | 2009 |
Alignment of biological sequences with quality scores | 2 | 0.41 | 2009 |
Probing the Randomness of Proteins by Their Subsequence Composition | 0 | 0.34 | 2009 |
Motif patterns in 2D | 9 | 0.53 | 2008 |
Fast algorithms for computing sequence distances by exhaustive substring composition. | 10 | 0.56 | 2008 |
Table Compression by Record Intersections | 6 | 0.46 | 2008 |
Periodicity and repetitions in parameterized strings | 9 | 0.49 | 2008 |
Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n2logn) time | 10 | 0.66 | 2008 |
Scoring Unusual Words with Varying Mismatch Errors | 4 | 0.43 | 2008 |
Parameterized matching with mismatches | 22 | 0.81 | 2007 |
Fast gapped variants for Lempel--Ziv--Welch compression | 5 | 0.47 | 2007 |
Articles selected from posters presented at the Tenth Annual International Conference on Research in Computational Biology - Preface | 16 | 0.56 | 2007 |
Incremental Discovery of Irredundant Motif Bases in Time O(|Sigma| n2 log n) | 0 | 0.34 | 2007 |
2004 Symposium on String Processing and Information Retrieval | 0 | 0.34 | 2007 |
Motif discovery by monotone scores | 10 | 0.77 | 2007 |
Compressing With Collapsible Tries | 0 | 0.34 | 2006 |
Advances in information retrieval: an introduction to the special issue | 2 | 0.39 | 2006 |
06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery | 0 | 0.34 | 2006 |
06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery | 0 | 0.34 | 2006 |
On the Monotonicity of the String Correction Factor for Words with Mismatches | 1 | 0.41 | 2006 |
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006 | 11 | 2.10 | 2006 |
Textual Compression by Collapsible Tries | 0 | 0.34 | 2006 |
Mining, compressing and classifying with extensible motifs. | 16 | 0.76 | 2006 |