scientific article

From MaRDI portal
Publication:3747742

zbMath0608.68058MaRDI QIDQ3747742

Zvi Galil, Raffaele Giancarlo

Publication date: 1985


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (31)

Boyer-Moore approach to approximate string matchingMultidimensional period recoveryBit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case timeParallel string matching with k mismatchesData structures and algorithms for approximate string matchingOn pattern matching with \(k\) mismatches and few don't caresLocating maximal approximate runs in a stringFast and Simple Computations Using Prefix Tables Under Hamming and Edit DistanceChecking whether a word is Hamming-isometric in linear timeMaximal degenerate palindromes with gaps and mismatchesPattern matching in the Hamming distance with thresholdsPeriod recovery of strings over the Hamming and edit distances2-dimensional palindromes with \(k\) mismatchesExtending alignments with \(k\)-mismatches and \(\ell\)-gapsDouble string tandem repeatsPattern matching with address errors: rearrangement distancesPractical Performance of Space Efficient Data Structures for Longest Common Extensions.On string matching with mismatchesA fast algorithm for string matching with mismatchesOn the string matching with \(k\) mismatchesOn approximate pattern matching with thresholdsA randomized numerical aligner (rNA)String indexing for patterns with wildcardsExploiting word-level parallelism for fast convolutions and their applications in approximate string matchingSimple and efficient string matching with k mismatchesFast parallel and serial multidimensional approximate array matchingEfficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distancesSmall-space LCE data structure with constant-time queriesFast and practical approximate string matchingEfficient Identification of k-Closed StringsApproximate periodicity




This page was built for publication: