Publication:3747742
From MaRDI portal
zbMath0608.68058MaRDI QIDQ3747742
Publication date: 1985
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68Q45: Formal languages and automata
Related Items
Boyer-Moore approach to approximate string matching, Small-space LCE data structure with constant-time queries, Efficient Identification of k-Closed Strings, Practical Performance of Space Efficient Data Structures for Longest Common Extensions., Maximal degenerate palindromes with gaps and mismatches, On pattern matching with \(k\) mismatches and few don't cares, On approximate pattern matching with thresholds, Simple and efficient string matching with k mismatches, A fast algorithm for string matching with mismatches, Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances, Pattern matching with address errors: rearrangement distances, Parallel string matching with k mismatches, Data structures and algorithms for approximate string matching, Period recovery of strings over the Hamming and edit distances, On string matching with mismatches, On the string matching with \(k\) mismatches, A randomized numerical aligner (rNA), Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching, Fast and practical approximate string matching, Pattern matching in the Hamming distance with thresholds, Multidimensional period recovery, 2-dimensional palindromes with \(k\) mismatches, String indexing for patterns with wildcards, Fast parallel and serial multidimensional approximate array matching, Approximate periodicity, Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time, Locating maximal approximate runs in a string, Extending alignments with \(k\)-mismatches and \(\ell\)-gaps, Checking whether a word is Hamming-isometric in linear time, Double string tandem repeats, Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance
