A simple pattern matching algorithm for weighted sequences

Authors:
Inbok Lee
Affiliations:
Korea Aerospace University, Goyang, Republic of Korea
Venue:
Proceedings of the 2012 ACM Research in Applied Computation Symposium
Year:
2012

Citing 7
Cited 0

A very fast substring search algorithm

Communications of the ACM
A new approach to text searching

Communications of the ACM
A fast string searching algorithm

Communications of the ACM
Faster String Matching with Super-Alphabets

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Using sequence compression to speedup probabilistic profile matching

Bioinformatics
Fast search algorithms for position specific scoring matrices

BIRD'07 Proceedings of the 1st international conference on Bioinformatics research and development
Pattern matching in pseudo real-time

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Weighted sequences are widely used in various areas including information retrieval, bioinformatics, and music analysis. In this paper we show how to apply the Boyer-Moore algorithm [2] for weighted sequences. As our algorithm is based on the Boyer-Moore algorithm, it works well when the size of alphabet is huge which is the case in information retrieval. Also, we show how to handle the case with small alphabets by considering two or more characters at once.