Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

113

CPM
1995
Springer

93views Combinatorics» more CPM 1995»

Matching a Set of Strings with Variable Length Don't Cares

15 years 5 months ago

Matching a Set of Strings with Variable Length Don't Cares

Download www2.lifl.fr

Gregory Kucherov, Michaël Rusinowitch

Real-time Traffic

Combinatorics | CPM 1995 |

claim paper

Related Content

» String Kernels Based on VariableLengthDontCare Patterns

» VGRAM Improving Performance of Approximate Queries on String Collections Using VariableLen...

» Regular Expression Matching with MultiStrings

» A Point SymmetryBased Clustering Technique for Automatic Evolution of Clusters

» Scalable sequential pattern mining for biological sequences

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	1995
Where	CPM
Authors	Gregory Kucherov, Michaël Rusinowitch

Comments (0)