scientific article; zbMATH DE number 1044854
From MaRDI portal
Publication:4347080
zbMath0874.68006MaRDI QIDQ4347080
No author found.
Publication date: 6 August 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Related Items (37)
Collage system: A unifying framework for compressed pattern matching. ⋮ Two-dimensional pattern matching with rotations ⋮ Scaled and permuted string matching ⋮ A hierarchical clustering algorithm for categorical sequence data ⋮ Faster two-dimensional pattern matching with rotations ⋮ Location-Aware Real-Time Recommender Systems for Brick-and-Mortar Retailers ⋮ Motif discovery by monotone scores ⋮ On the hardness of computing the edit distance of shallow trees ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ Overlap matching. ⋮ BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation ⋮ Monge properties of sequence alignment ⋮ Unnamed Item ⋮ Parameterized matching with mismatches ⋮ The effect of multiple reference characters on detecting matches in string-searching algorithms ⋮ Property testing of regular tree languages ⋮ Generalized function matching ⋮ Periodicity and repetitions in parameterized strings ⋮ Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time ⋮ Some theoretical challenges in digital geometry: a perspective ⋮ Unnamed Item ⋮ The wide window string matching algorithm ⋮ Boosting Pattern Matching Performance via k-bit Filtering ⋮ Periodicity in data streams with wildcards ⋮ A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms ⋮ Parameterized matching on non-linear structures ⋮ Discovering subword associations in strings in time linear in the output size ⋮ The constrained longest common subsequence problem ⋮ Sparse LCS common substring alignment ⋮ Approximate string matching on Ziv--Lempel compressed text ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ Parallel construction and query of index data structures for pattern matching on square matrices ⋮ Simple and fast linear space computation of longest common subsequences ⋮ Tree pattern matching with a more general notion of occurrence of the pattern. ⋮ A speed-up for the commute between subword trees and DAWGs. ⋮ Compact recognizers of episode sequences ⋮ Periodicity and Repetitions in Parameterized Strings
This page was built for publication:
