Data structures and algorithms for approximate string matching
From MaRDI portal
DOI10.1016/0885-064X(88)90008-8zbMATH Open0646.68078OpenAlexW1981320868MaRDI QIDQ1104103FDOQ1104103
Authors: R. Giancarlo, Zvi Galil 
Publication date: 1988
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0885-064x(88)90008-8
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The String-to-String Correction Problem
- A fast string searching algorithm
- Title not available (Why is that?)
- Parallel Prefix Computation
- A Space-Economical Suffix Tree Construction Algorithm
- A faster algorithm computing string edit distances
- A linear space algorithm for computing maximal common subsequences
- Fast Algorithms for Finding Nearest Common Ancestors
- Generalized String Matching
- A fast algorithm for computing longest common subsequences
- Parallelism in random access machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding approximate patterns in strings
- Efficient string matching with k mismatches
- Title not available (Why is that?)
- The longest common subsequence problem revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Efficient General-Purpose Parallel Computer
- Parallel string matching with k mismatches
- Title not available (Why is that?)
Cited In (42)
- Full-text indexes for high-throughput sequencing
- Approximate word sequence matching on an inverted file index
- 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
- On similarity of polynomial configurations
- On the Suffix Automaton with Mismatches
- Approximate string processing
- Faster approximate string matching for short patterns
- Efficient algorithms for approximate string matching with swaps
- Approximate string-matching with \(q\)-grams and maximal matches
- Sublinear approximate string matching and biological applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate string matching with suffix automata
- Multiple filtration and approximate pattern matching
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
- EFFICIENT PARALLEL ALGORITHMS FOR PATTERN RECOGNITION∗
- From Nerode's congruence to suffix automata with mismatches
- An efficient algorithm for some tree matching problems
- An improved algorithm for computing the edit distance of run-length coded strings
- Title not available (Why is that?)
- A programmable array processor architecture for flexible approximate string matching algorithms
- Fast approximate matching of words against a dictionary
- Optimal data compression algorithm
- Analysis of two-dimensional approximate pattern matching algorithms
- Efficient techniques for approximate record matching modulo permutations
- Edit distance for a run-length-encoded string and an uncompressed string
- Fast parallel and serial multidimensional approximate array matching
- Universal Data Compression Algorithm Based on Approximate String Matching
- Block edit models for approximate string matching
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results
- On-line construction of suffix trees
- String matching with weighted errors
- Alignments and approximate string matching
- EFFICIENT AUTOMATA CONSTRUCTIONS AND APPROXIMATE AUTOMATA
- Title not available (Why is that?)
- A note on the subtree isomorphism for ordered trees and related problems
- A dynamic edit distance table
- A model and a fast algorithm for multiple errors spelling correction
- Boyer-Moore approach to approximate string matching
- Construction of Fundamental Data Structures for Strings
This page was built for publication: Data structures and algorithms for approximate string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104103)
