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