scientific article; zbMATH DE number 5725179

zbMATH Open1230.68001MaRDI QIDQ3570040FDOQ3570040

Authors: Christian Charras, Thierry Lecroq 

Publication date: 23 June 2010

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Algorithms on strings (68W32) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)

Cited In (30)

• A graph-theoretic model to solve the approximate string matching problem allowing for translocations
• Creating improvisations on chord progressions using suffix trees
• On the Structure of Consistent Partitions of Substring Set of a Word
• Optimal pattern matching algorithms
• Fast and flexible packed string matching
• Linear and efficient string matching algorithms based on weak factor recognition
• Content-dependent chunking for differential compression, the local maximum approach
• On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
• Fast exact string matching algorithms
• The structure of subword graphs and suffix trees of Fibonacci words
• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
• An aggressive algorithm for multiple string matching
• Boosting pattern matching performance via \(k\)-bit filtering
• A filtering technique for all pairs approximate parameterized string matching
• The swap matching problem revisited
• A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns
• Efficient variants of the backward-oracle-matching algorithm
• A faster quick search algorithm
• A unifying look at the Apostolico--Giancarlo string-matching algorithm
• Fast string matching for DNA sequences
• Using pattern matching for tiling and packing problems
• The wide window string matching algorithm
• Improved pattern-scan-order algorithms for string matching
• A very fast string matching algorithm based on condensed alphabets
• PAMA: A FAST STRING MATCHING ALGORITHM
• Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
• Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
• BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation
• A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS
• Designing optimal- and fast-on-average 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 Q3570040)