scientific article; zbMATH DE number 1754502
From MaRDI portal
Publication:4534878
zbMath0992.92029MaRDI QIDQ4534878
Mathieu Raffinot, Gonzalo Navarro
Publication date: 12 June 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computing methodologies and applications (68U99) Biochemistry, molecular biology (92C40) General biology and biomathematics (92B05) Research exposition (monographs, survey articles) pertaining to biology (92-02)
Related Items
A matching algorithm in PMWL based on CluTree, Approximate string matching using a bidirectional index, 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, On pattern matching with \(k\) mismatches and few don't cares, Efficient accuracy evaluation for multi-modal sensed data, Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm, A Bit-Parallel Exact String Matching Algorithm for Small Alphabet, Compact and fast algorithms for safe regular expression search, Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform, Run-Length Encoded Nondeterministic KMP and Suffix Automata, Checking whether a word is Hamming-isometric in linear time, A weak approach to suffix automata simulation for exact and approximate string matching, Fast detection of specific fragments against a set of sequences, A filtration method for order-preserving matching, On String Matching in Chunked Texts, Left is Better Than Right for Reducing Nondeterminism of NFAs, Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics, On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns, String matching with alphabet sampling, BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation, Construction of minimal deterministic finite automata from biological motifs, Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton, Revisiting multiple pattern matching algorithms for multi-core architecture, Multi-pattern matching algorithm with wildcards based on bit-parallelism, Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism, From cascade decompositions to bit-vector algorithms., Searching for a set of correlated patterns, Fast profile matching algorithms - A survey, Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism, An algorithm to compute the character access count distribution for pattern matching algorithms, On string matching with mismatches, DARN! A weighted constraint solver for RNA motif localization, On the string matching with \(k\) mismatches, Fast pattern-matching on indeterminate strings, Fast searching in packed strings, Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching, The wide window string matching algorithm, A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms, Nested Counters in Bit-Parallel String Matching, The exact multiple pattern matching problem solved by a reference tree approach, Improved online algorithms for jumbled matching, Solving similarity joins and range queries in metric spaces with the list of twin clusters, Fast Searching in Packed Strings, A Table Compression Method for Extended Aho-Corasick Automaton, Computing the Expected Edit Distance from a String to a PFA, Unnamed Item, Average-optimal string matching, 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
