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