Finding approximate patterns in strings
From MaRDI portal
Recommendations
Cited in
(57)- A robust algorithm for identification of proteins in a database
- Data structures and algorithms for approximate string matching
- Fast string matching with k differences
- Approximate string-matching with q-grams and maximal matches
- Sublinear approximate string matching and biological applications
- A sublinear algorithm for approximate keyword searching
- Efficient matching of nonrectangular shapes.
- Algorithms for approximate graph matching
- Improved approximate pattern matching on hypertext
- Approximate string matching with compressed indexes
- Approximate string matching on Ziv--Lempel compressed text
- Fast and practical approximate string matching
- Edit distance of run-length encoded strings.
- Finding approximate palindromes in strings
- Application of max-plus algebra to biological sequence comparisons
- Approximate pattern matching and transitive closure logics.
- Fast approximate matching of words against a dictionary
- Multiple filtration and approximate pattern matching
- A subquadratic algorithm for approximate limited expression matching
- A constrained edit distance between unordered labeled trees
- A fully compressed algorithm for computing the edit distance of run-length encoded strings
- Topology of strings: median string is NP-complete
- Average-case linear-time similar substring searching by the q-gram distance
- Efficient generation of super condensed neighborhoods
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
- Bit-parallel approximate string matching algorithms with transposition
- FINDING ALL APPROXIMATE GAPPED PALINDROMES
- Dynamic programming for reduced NFAs for approximate string and sequence matching.
- Pattern Avoidance and Overlap in Strings
- The finite automata approaches in stringology
- Fast approximate search in large dictionaries
- Approximate Periods with Levenshtein Distance
- Algorithms for String Pattern Discovery
- A new filtration method and a hybrid strategy for approximate string matching
- scientific article; zbMATH DE number 176144 (Why is no real title available?)
- scientific article; zbMATH DE number 1303588 (Why is no real title available?)
- New and faster filters for multiple approximate string matching
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results
- Enumerating Neighbour and Closest Strings
- Boyer-Moore approach to approximate string matching
- A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm
- Multiple approximate string matching
- Algorithms – ESA 2005
- A survey on tree edit distance and related problems
- Finding similar consensus between trees: An algorithm and a distance hierarchy
- Finding approximate patterns in undirected acyclic graphs
- On using q-gram locations in approximate string matching
- The longest common extension problem revisited and applications to approximate string searching
- A unified view to string matching algorithms
- Improvements on permutation reconstruction from minors
- Approximate string matching with suffix automata
- Bounded weighted edit distance: dynamic algorithms and matching lower bounds
- Regularity of a dynamic neighborhood of a regular language
- Matching regular expressions on uncertain data
- A dynamic edit distance table
- String matching with weighted errors
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
This page was built for publication: Finding approximate patterns in strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3681960)
