Corpus ID: 16526335

A Sub-quadratic Algorithm for Approximate Limited Expression Matching 1

@inproceedings{Wu1992ASA,
  title={A Sub-quadratic Algorithm for Approximate Limited Expression Matching 1},
  author={Sun Wu and Udi Manber and G. T. Myers},
  year={1992}
}
  • Sun Wu, Udi Manber, G. T. Myers
  • Published 1992
  • In this paper we present an efficient sub-quadratic time algorithm for matching strings and limited expressions in large texts. Limited expressions are a subset of regular expressions that appear often in practice. The generalization from simple strings to limited expressions has a negligible affect on the speed of our algorithm, yet allows much more flexibility. Our algorithm is similar in spirit to that of Masek and Paterson [MP80], but it is much faster in practice. Our experiments show a… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 29 CITATIONS

    On Bit-Parallel Processing of Multi-byte Text

    VIEW 5 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Faster Approximate String Matching

    VIEW 13 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    A Partial Deterministic Automaton for Approximate String Matching

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Fast and flexible string matching by combining bit-parallelism and suffix automata

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    A Faster Algorithm for Approximate String Matching

    VIEW 3 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    TATCGTATTATGGACAAGCTTTAACTGTCGTACTGTGGAGGCTTCAAAACGGAGGGACCAAAAAATTTGCTTCTAGCGT CAATGAAAAGAAGTCGGGTGTATGCCCCAATTCCTTGCTGCCCGGACGGCCAGGCTTATGTACAATCCACGCGGTAC TACATCTTGTCTCTTATGTAGGGTTCAGTTCTTCGCGCAATCATAGCGGTACTTCATAATGGGACACAACGAATCGCGG CCGGATATCACATCTGCTCCTGTGATGGAATTGCTGAATGCGCAGGTGTGAATACTGCGGCT

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 23 REFERENCES

    A new approach to text searching,’

    • A Baeza-YatesR., G. H. Gonnet
    • Communications of the ACM
    • 1992

    Approximate String Matching with q-grams and Maximal Matches

    • Esko Ukkonen
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 1992

    An Improved Algorithm for Approximate String Matching

    Approximate string matching in sublinear expected time

    Fast String Matching with k Differences