scientific article; zbMATH DE number 1754502
From MaRDI portal
Publication:4534878
The authors present a practical approach to string matching problems, special attention being paid to the algorithms and their implementation that perform best in practice. This book covers searching for simple, multiple, and extended strings, as well as regular expressions, exactly and approximately. It includes all of the most significant new developments in complex pattern searching. The clear explanation, step-by-step examples, algorithm pseudocode, and implementation efficiency maps will enable the readers to choose the most appropriate algorithms for their applications. This book is intended for professionals, researchers, and students in computer science, bioinformatics, and software engineering.
Recommendations
Cited in
(60)- Solving similarity joins and range queries in metric spaces with the list of twin clusters
- Average-optimal string matching
- From cascade decompositions to bit-vector algorithms.
- An algorithm to compute the character access count distribution for pattern matching algorithms
- On string matching with mismatches
- On the string matching with \(k\) mismatches
- The wide window string matching algorithm
- The exact multiple pattern matching problem solved by a reference tree approach
- Improved online algorithms for jumbled matching
- On-line string matching in highly similar DNA sequences
- Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
- Revisiting multiple pattern matching algorithms for multi-core architecture
- Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata
- Bit-parallel approximate string matching algorithms with transposition
- Sequential and indexed two-dimensional combinatorial template matching allowing rotations
- A matching algorithm in PMWL based on CluTree
- Checking whether a word is Hamming-isometric in linear time
- A weak approach to suffix automata simulation for exact and approximate string matching
- Computing the expected edit distance from a string to a PFA
- Optimization approaches for solving string selection problems
- Run-Length Encoded Nondeterministic KMP and Suffix Automata
- Approximate string matching using a bidirectional index
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
- On pattern matching with \(k\) mismatches and few don't cares
- Efficient accuracy evaluation for multi-modal sensed data
- On String Matching in Chunked Texts
- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
- Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm
- Nested Counters in Bit-Parallel String Matching
- Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R
- Fast Searching in Packed Strings
- A Table Compression Method for Extended Aho-Corasick Automaton
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
- String matching with alphabet sampling
- scientific article; zbMATH DE number 1966522 (Why is no real title available?)
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
- Computing the expected edit distance from a string to a probabilistic finite-state automaton
- Compact and fast algorithms for safe regular expression search
- scientific article; zbMATH DE number 828444 (Why is no real title available?)
- String algorithms in C. Efficient text representation and search
- scientific article; zbMATH DE number 7286689 (Why is no real title available?)
- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
- Fast searching in packed strings
- Multi-pattern matching algorithm with wildcards based on bit-parallelism
- Fast detection of specific fragments against a set of sequences
- Left is Better Than Right for Reducing Nondeterminism of NFAs
- BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation
- Construction of minimal deterministic finite automata from biological motifs
- Accelerating Boyer-Moore searches on binary texts
- Multiple serial episodes matching
- Efficient parameterized string matching
- A general compression algorithm that supports fast searching
- Fast exact string matching algorithms
- A filtration method for order-preserving matching
- Searching for a set of correlated patterns
- Fast profile matching algorithms - A survey
- DARN! A weighted constraint solver for RNA motif localization
- Fast pattern-matching on indeterminate strings
- Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4534878)
