Amanote Research

Amanote Research

    RegisterSign In

Faster Compressed Dictionary Matching

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-16321-0_19
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2010

Authors
Wing-Kai HonTsung-Han KuRahul ShahSharma V. ThankachanJeffrey Scott Vitter
Publisher

Springer Berlin Heidelberg


Related search

Compressed Index for Dictionary Matching

2008English

Succinct 2D Dictionary Matching

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2012English

Group 4 Compressed Document Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Faster Compressed Suffix Trees for Repetitive Text Collections

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Loudness Matching for Compressed Speech Signals

Journal of the Acoustical Society of America
AcousticsUltrasonicsArtsHumanities
1991English

Optimal Spaced Seeds for Faster Approximate String Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Faster Scaling Algorithms for General Graph Matching Problems

1989English

Joint Dictionary Learning Reconstruction of Compressed Multi-Contrast Magnetic Resonance Imaging

2017English

Sparsity Adaptive Matching Pursuit Algorithm for Practical Compressed Sensing

2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy