Fast parallel and serial approximate string matching
From MaRDI portal
Recommendations
Cited in
(82)- On updating suffix tree labels
- An approximate string-matching algorithm
- Approximate string-matching with q-grams and maximal matches
- Efficient CRCW-PRAM algorithms for universal substring searching
- Identifying periodic occurrences of a template with applications to protein structure
- Efficient algorithms for approximate string matching with swaps
- Sublinear approximate string matching and biological applications
- Algorithms for approximate graph matching
- Block edit models for approximate string matching
- Generalizations of suffix arrays to multi-dimensional matrices.
- Overlap matching.
- Computing longest common extensions in partial words
- Longest common extension
- Period recovery of strings over the Hamming and edit distances
- Finding maximal 2-dimensional palindromes
- Approximate swapped matching.
- Finding approximate palindromes in strings
- Fast approximate matching of words against a dictionary
- Multiple filtration and approximate pattern matching
- A constrained edit distance between unordered labeled trees
- 2-dimensional palindromes with k mismatches
- Fast parallel and serial multidimensional approximate array matching
- Two-dimensional maximal repetitions
- Approximate pattern matching in LZ77-compressed texts
- Swap and mismatch edit distance
- Locating maximal approximate runs in a string
- Speeding up the detection of tandem repeats over the edit distance
- Average-case linear-time similar substring searching by the q-gram distance
- Time-space trade-offs for longest common extensions
- Optimal spaced seeds for faster approximate string matching
- Double string tandem repeats
- Fast string matching in stationary ergodic sources
- Time-Space Trade-Offs for Longest Common Extensions
- Longest common extensions in trees
- Longest common extensions in sublinear space
- Longest common extensions in trees
- On the relationship between histogram indexing and block-mass indexing
- A new filtration method and a hybrid strategy for approximate string matching
- A fast VLSI solution for approximate string matching
- scientific article; zbMATH DE number 4126689 (Why is no real title available?)
- scientific article; zbMATH DE number 4126691 (Why is no real title available?)
- Constant-Time Randomized Parallel String Matching
- New and faster filters for multiple approximate string matching
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results
- scientific article; zbMATH DE number 4119620 (Why is no real title available?)
- scientific article; zbMATH DE number 2112398 (Why is no real title available?)
- Boyer-Moore approach to approximate string matching
- Pattern matching in hypertext
- Multiple approximate string matching
- Random access to grammar-compressed strings and trees
- Approximate XML structure validation based on document-grammar tree similarity
- A Memory-Efficient and Modular Approach for Large-Scale String Pattern Matching
- A practical semi-external memory method for approximate pattern matching
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
- A survey on tree edit distance and related problems
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
- THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW
- Simple and efficient string matching with k mismatches
- Parallel String Matching
- Range LCP
- Generalizations of suffix arrays to multi-dimensional matrices.
- The approximate swap and mismatch edit distance
- scientific article; zbMATH DE number 7765421 (Why is no real title available?)
- Matching patterns with variables under edit distance
- The longest common extension problem revisited and applications to approximate string searching
- Fast parallel string prefix-matching
- Matching statistics -- a survey
- Approximate string matching with suffix automata
- Approximate circular pattern matching under edit distance
- Faster approximate string matching for short patterns
- Approximate circular pattern matching
- Approximate suffix-prefix dictionary queries
- An almost optimal edit distance oracle
- Pattern matching with mismatches and wildcards
- Faster approximate elastic-degenerate string matching. Part A
- Approximate string matching using compressed suffix arrays
- A dynamic edit distance table
- String matching with weighted errors
- Improved approximate string matching using compressed suffix data structures
- Efficient algorithms for the block edit problems
- Some theoretical challenges in digital geometry: a perspective
This page was built for publication: Fast parallel and serial approximate string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4203810)
