Abstract
In contrast to the extensively studied k-differences problem, in the weighted local similarity search problem one searches for approximate matches of subwords of a pattern and subwords of a text whose lengths exceed a certain threshold. Moreover, arbitrary gap and substitution weights are allowed. In this paper, two new prefilter algorithms for the weighted local similarity search problem are presented. These overcome the disadvantages of a similar filter algorithm devised by Myers.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
W.I. Chang and J. Lampe. Theoretical and Empirical Comparisons of Approximate String Matching Algorithms. In Proc. CPM, pages 175–184. LNCS 644, 1992.
W.I. Chang and E.L. Lawler. Sublinear Approximate String Matching and Biological Applications. Algorithmica, 12(4/5):327–344, 1994.
W.I. Chang and T.G. Marr. Approximate String Matching and Local Similarity. In Proc. CPM, pages 259–273. LNCS 807, 1994.
Z. Galil and R. Giancarlo. Data Structures and Algorithms for Approximate String Matching. Journal of Complexity, 4:33–72, 1988.
Z. Galil and K. Park. An Improved Algorithm for Approximate String Matching. SIAM Journal on Computing, 19(6):989–999, 1990.
S. Kurtz. Approximate String Searching under Weighted Edit Distance. In Proc. Third South American Workshop on String Processing, pages 156–170. Carlton University Press, 1996.
G.M. Landau and U. Vishkin. Fast String Matching with k Differences. Journal of Computer and Systems Sciences, 37:63–78, 1988.
E.W. Myers. A Sublinear Algorithm for Approximate Keyword Searching. Algorithmica, 12(4/5):345–374, 1994.
E.W. Myers. Algorithmic Advances for Searching Biosequence Databases. In Computational Methods in Genome Research, pages 121–135. Plenum Press, 1994.
P.H. Sellers. The Theory and Computation of Evolutionary Distances: Pattern Recognition. Journal of Algorithms, 1:359–373, 1980.
E. Sutinen and J. Tarhio. On Using q-Gram Locations in Approximate String Matching. In Proc. ESA, pages 327–340. LNCS 979, 1995.
E. Sutinen and J. Tarhio. Filtration with q-Samples in Approximate Matching. In Proc. CPM, pages 50–63. LNCS 1075, 1996.
T. Takaoka. Approximate Pattern Matching with Samples. In Proc. ISAAC, pages 234–242. LNCS 834, 1994.
J. Tarhio and E. Ukkonen. Approximate Boyer-Moore String Matching. SIAM Journal on Computing, 22(2):243–260, 1993.
E. Ukkonen. Finding Approximate Patterns in Strings. Journal of Algorithms, 6:132–137, 1985.
E. Ukkonen. Approximate String-Matching with q-Grams and Maximal Matches. Theoretical Computer Science, 92(1):191–211, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ohlebusch, E. (1997). A filter method for the weighted local similarity search problem. In: Apostolico, A., Hein, J. (eds) Combinatorial Pattern Matching. CPM 1997. Lecture Notes in Computer Science, vol 1264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63220-4_60
Download citation
DOI: https://doi.org/10.1007/3-540-63220-4_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63220-7
Online ISBN: 978-3-540-69214-0
eBook Packages: Springer Book Archive