Average-optimal string matching
- 1 December 2009
- journal article
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 7 (4) , 579-594
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Bit-parallel string matching under Hamming distance in O(n⌈m/w⌉) worst case timeInformation Processing Letters, 2008
- Indexing Circular Patterns2008
- FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIMEInternational Journal of Foundations of Computer Science, 2006
- Sequential and indexed two-dimensional combinatorial template matching allowing rotationsTheoretical Computer Science, 2005
- Bit-parallel approximate string matching algorithms with transpositionJournal of Discrete Algorithms, 2005
- Bit-parallel -matching and suffix automataJournal of Discrete Algorithms, 2005
- Bit-Parallel Witnesses and Their Applications to Approximate String MatchingAlgorithmica, 2004
- Practical fast searching in stringsSoftware: Practice and Experience, 1980
- A fast string searching algorithmCommunications of the ACM, 1977
- Efficient string matchingCommunications of the ACM, 1975