scientific article
From MaRDI portal
Publication:3570040
zbMath1230.68001MaRDI QIDQ3570040
Christian Charras, Thierry Lecroq
Publication date: 23 June 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00) Algorithms on strings (68W32)
Related Items
PAMA: A FAST STRING MATCHING ALGORITHM, The swap matching problem revisited, Fast exact string matching algorithms, Using pattern matching for tiling and packing problems, The structure of subword graphs and suffix trees of Fibonacci words, On the Structure of Consistent Partitions of Substring Set of a Word, A Bit-Parallel Exact String Matching Algorithm for Small Alphabet, A unifying look at the Apostolico--Giancarlo string-matching algorithm, On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees, Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform, A graph-theoretic model to solve the approximate string matching problem allowing for translocations, Fast and flexible packed string matching, BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation, A Filtering Technique for All Pairs Approximate Parameterized String Matching, Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition, Optimal pattern matching algorithms, A faster quick search algorithm, A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS, Designing optimal- and fast-on-average pattern matching algorithms, Content-dependent chunking for differential compression, the local maximum approach, The wide window string matching algorithm, Boosting Pattern Matching Performance via k-bit Filtering, An aggressive algorithm for multiple string matching, Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm, Improved pattern-scan-order algorithms for string matching, A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns, Creating improvisations on chord progressions using suffix trees, Fast string matching for DNA sequences, A Very Fast String Matching Algorithm Based on Condensed Alphabets, EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM