scientific article; zbMATH DE number 1445379
From MaRDI portal
Publication:4952702
zbMath0957.68125MaRDI QIDQ4952702
Ely Porat, Amihood Amir, Moshe Lewenstein
Publication date: 10 May 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Approximate string matching using compressed suffix arrays ⋮ Automata evaluation and text search protocols with simulation-based security ⋮ Swap and mismatch edit distance ⋮ Set intersection and sequence matching with mismatch counting ⋮ Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time ⋮ Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance ⋮ Overlap matching. ⋮ Pattern matching in the Hamming distance with thresholds ⋮ Extending alignments with \(k\)-mismatches and \(\ell\)-gaps ⋮ Improved approximate string matching using compressed suffix data structures ⋮ Pattern matching with pair correlation distance ⋮ On approximate pattern matching with thresholds ⋮ Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching ⋮ Faster pattern matching with character classes using prime number encoding ⋮ Computationally secure pattern matching in the presence of malicious adversaries ⋮ Average-optimal string matching
This page was built for publication:
