
Conferences in DBLP
ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations. [Citation Graph (, )][DBLP]
Lower Bounds for Succinct Data Structures. [Citation Graph (, )][DBLP]
The Changing Face of Web Search. [Citation Graph (, )][DBLP]
TwoDimensional Pattern Matching with Combined Scaling and Rotation. [Citation Graph (, )][DBLP]
Searching for Gapped Palindromes. [Citation Graph (, )][DBLP]
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. [Citation Graph (, )][DBLP]
Finding Largest WellPredicted Subset of Protein Structure Models. [Citation Graph (, )][DBLP]
HP Distance Via Double Cut and Join Distance. [Citation Graph (, )][DBLP]
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots. [Citation Graph (, )][DBLP]
Faster Algorithm for the Set Variant of the String Barcoding Problem. [Citation Graph (, )][DBLP]
Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics. [Citation Graph (, )][DBLP]
Analysis of the Size of Antidictionary in. [Citation Graph (, )][DBLP]
Approximate String Matching with Address Bit Errors. [Citation Graph (, )][DBLP]
OnLine Approximate String Matching with Bounded Errors. [Citation Graph (, )][DBLP]
A Black Box for Online Approximate Pattern Matching. [Citation Graph (, )][DBLP]
An(other) EntropyBounded Compressed Suffix Tree. [Citation Graph (, )][DBLP]
On Compact Representations of AllPairsShortestPathDistance Matrices. [Citation Graph (, )][DBLP]
Computing Inverse ST in Linear Complexity. [Citation Graph (, )][DBLP]
Dynamic FullyCompressed Suffix Trees. [Citation Graph (, )][DBLP]
A Linear Delay Algorithm for Building Concept Lattices. [Citation Graph (, )][DBLP]
Matching Integer Intervals by Minimal Sets of Binary Words with don't cares. [Citation Graph (, )][DBLP]
Fast Algorithms for Computing Tree LCS. [Citation Graph (, )][DBLP]
Why Greed Works for Shortest Common Superstring Problem. [Citation Graph (, )][DBLP]
Constrained LCS: Hardness and Approximation. [Citation Graph (, )][DBLP]
Finding Additive Biclusters with Random Background. [Citation Graph (, )][DBLP]
An Improved Succinct Representation for Dynamic kary Trees. [Citation Graph (, )][DBLP]
Towards a Solution to the "Runs" Conjecture. [Citation Graph (, )][DBLP]
On the Longest Common Parameterized Subsequence. [Citation Graph (, )][DBLP]
