article

Generalized string matching

Author:

Karl AbrahamsonAuthors Info & Claims

SIAM Journal on Computing, Volume 16, Issue 6

Pages 1039 - 1051

https://doi.org/10.1137/0216067

Published: 01 December 1987 Publication History

Abstract

No abstract available.

Cited By

View all

Jin CXu YMohar BShinkar IO'Donnell R(2024)Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and MoreProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649605(1573-1584)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649605
Chan TVassilevska Williams VXu YSaha BServedio R(2023)Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and MoreProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585237(419-432)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585237
Chan TWilliams VXu YLeonardi SGupta A(2022)Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OVProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520032(1501-1514)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3520032
Show More Cited By

Index Terms

Generalized string matching
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Pattern matching

Recommendations

String Matching under a General Matching Relation

In standard string matching, each symbol matches only itself, In other string matching problems, e.g., the string matching with "don t-cares" problem, a symbol may match several symbols. In general, an arbitrary many-to-many matching relation might hold ...
A fast bit-parallel multi-patterns string matching algorithm for biological sequences
ISB '10: Proceedings of the International Symposium on Biocomputing

The problem of searching occurrences of a pattern P[0...m-1] in the text T[0...n-1>with m ≤ n, where the symbols of P and T are drawn from some alphabet Σ of size σ, is called exact string matching problem. In the present day, pattern matching is a ...
An algorithm to improve the performance of string matching

Approximate string matching algorithms are techniques used to find a pattern 'P' in a text 'T' partially or exactly. These techniques become very important in terms of performance and the accuracy of searching results. In this paper, we propose a ...

Comments

Information & Contributors

Information

Published In

SIAM Journal on Computing Volume 16, Issue 6

December 1, 1987

192 pages

ISSN:0097-5397

Editor:
S. Rao Kosaraju

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 December 1987

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

110
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jin CXu YMohar BShinkar IO'Donnell R(2024)Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and MoreProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649605(1573-1584)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649605
Chan TVassilevska Williams VXu YSaha BServedio R(2023)Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and MoreProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585237(419-432)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585237
Chan TWilliams VXu YLeonardi SGupta A(2022)Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OVProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520032(1501-1514)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3520032
Bringmann KFischer NNakos VKhuller SVassilevska Williams V(2021)Sparse nonnegative convolution is equivalent to dense nonnegative convolutionProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451090(1711-1724)Online publication date: 15-Jun-2021
https://dl.acm.org/doi/10.1145/3406325.3451090
Zhou JChoo KCao ZDong X(2021)PVOPM: Verifiable Privacy-Preserving Pattern Matching with Efficient Outsourcing in the Malicious SettingIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2019.294743618:5(2253-2270)Online publication date: 1-Sep-2021
https://dl.acm.org/doi/10.1109/TDSC.2019.2947436
Bringmann KNakos VMakarychev KMakarychev YTulsiani MKamath GChuzhoy J(2020)Top-𝑘-convolution and the quest for near-linear output-sensitive subset sumProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3357713.3384308(982-995)Online publication date: 22-Jun-2020
https://dl.acm.org/doi/10.1145/3357713.3384308
Chan TGolan SKociumaka TKopelowitz TPorat EMakarychev KMakarychev YTulsiani MKamath GChuzhoy J(2020)Approximating text-to-pattern Hamming distancesProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3357713.3384266(643-656)Online publication date: 22-Jun-2020
https://dl.acm.org/doi/10.1145/3357713.3384266
Uznański P(2020)Recent Advances in Text-to-Pattern Distance AlgorithmsBeyond the Horizon of Computability10.1007/978-3-030-51466-2_32(353-365)Online publication date: 29-Jun-2020
https://dl.acm.org/doi/10.1007/978-3-030-51466-2_32
Bringmann KKönnemann MWellnitz PChan T(2019)Few matches or almost periodicityProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310504(1126-1145)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310504
Clifford RKociumaka TPorat EChan T(2019)The streaming k-mismatch problemProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310503(1106-1125)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310503
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

String Matching under a General Matching Relation

A fast bit-parallel multi-patterns string matching algorithm for biological sequences

An algorithm to improve the performance of string matching

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations