|
Conferences in DBLP
(stringology) 2009 (conf/stringology/2009)
Combining Text Compression and String Matching: The Miracle of Self-Indexing. [Citation Graph (, )][DBLP]
Feature Extraction for Image Pattern Matching with Cellular Automata. [Citation Graph (, )][DBLP]
On-line Construction of a Small Automaton for a Finite Set of Words. [Citation Graph (, )][DBLP]
Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts. [Citation Graph (, )][DBLP]
Finding Characteristic Substrings from Compressed Texts. [Citation Graph (, )][DBLP]
Delta Encoding in a Compressed Domain. [Citation Graph (, )][DBLP]
On Bijective Variants of the Burrows-Wheeler Transform. [Citation Graph (, )][DBLP]
On the Usefulness of Backspace. [Citation Graph (, )][DBLP]
An Efficient Algorithm for Approximate Pattern Matching with Swaps. [Citation Graph (, )][DBLP]
Searching for Jumbled Patterns in Strings. [Citation Graph (, )][DBLP]
Filter Based Fast Matching of Long Patterns by Using SIMD Instructions. [Citation Graph (, )][DBLP]
Validation and Decomposition of Partially Occluded Images with Holes. [Citation Graph (, )][DBLP]
Compressing Bi-Level Images by Block Matching on a Tree Architecture. [Citation Graph (, )][DBLP]
Taxonomies of Regular Tree Algorithms. [Citation Graph (, )][DBLP]
String Suffix Automata and Subtree Pushdown Automata. [Citation Graph (, )][DBLP]
On Minimizing Deterministic Tree Automata. [Citation Graph (, )][DBLP]
Constant-memory Iterative Generation of Special Strings Representing Binary Trees. [Citation Graph (, )][DBLP]
An Input Sensitive Online Algorithm for LCS Computation. [Citation Graph (, )][DBLP]
Bit-parallel Algorithms for Computing all the Runs in a String. [Citation Graph (, )][DBLP]
Crochemore's Repetitions Algorithm Revisited - Computing Runs. [Citation Graph (, )][DBLP]
Reducing Repetitions. [Citation Graph (, )][DBLP]
Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words. [Citation Graph (, )][DBLP]
Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. [Citation Graph (, )][DBLP]
Finding All Covers of an Indeterminate String in O(n) Time on Average. [Citation Graph (, )][DBLP]
|