scientific article; zbMATH DE number 1445379
From MaRDI portal
Publication:4952702
zbMATH Open0957.68125MaRDI QIDQ4952702FDOQ4952702
Authors: Amihood Amir, Ely Porat, Moshe Lewenstein 
Publication date: 10 May 2000
Title of this publication is not available (Why is that?)
Recommendations
Cited In (49)
- Pattern matching with pair correlation distance
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps
- A linear-time algorithm for the 1-mismatch problem
- Simple and efficient string matching with k mismatches
- Title not available (Why is that?)
- Approximate pattern matching with \(k\)-mismatches in packed text
- Faster pattern matching with character classes using prime number encoding
- Fast and simple computations using prefix tables under Hamming and edit distance
- Efficient string matching with k mismatches
- Swap and mismatch edit distance
- Fast string matching with k differences
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
- Faster algorithms for string matching with k mismatches
- Streaming \(k\)-mismatch with error correcting and applications
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
- An \(O(n\log n)\) algorithm for finding dissimilar strings
- Automata evaluation and text search protocols with simulation-based security
- A faster algorithm for matching a set of patterns with variable length don't cares
- Pattern matching in the Hamming distance with thresholds
- Finding witnesses by peeling
- Finding approximate repetitions under Hamming distance.
- Set intersection and sequence matching with mismatch counting
- A graph approach to the threshold all-against-all substring matching problem
- A randomized numerical aligner (rNA)
- A randomized numerical aligner (rNA)
- Approximate string matching using compressed suffix arrays
- Average-optimal string matching
- Few matches or almost periodicity: faster pattern matching with mismatches in compressed texts
- Computationally secure pattern matching in the presence of malicious adversaries
- Fast algorithms for approximately counting mismatches
- Overlap matching.
- Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
- Approximate Boyer-Moore string matching for small alphabets
- A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
- Mismatch sampling
- Title not available (Why is that?)
- An analysis of the Karp-Rabin string matching algorithm
- Finding Witnesses by Peeling
- FFT-based algorithms for the string matching with mismatches problem
- Circular pattern matching with \(k\) mismatches
- Circular pattern matching with \(k\) mismatches
- Fast average-case pattern matching by multiplexing sparse tables
- Longest common substrings with \(k\) mismatches
- Improved approximate string matching using compressed suffix data structures
- An efficient mapping for computing the score of string matching
- On string matching with mismatches
- On the string matching with \(k\) mismatches
- The \(k\)-mismatch problem revisited
- On approximate pattern matching with thresholds
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952702)
