Fast pattern-matching on indeterminate strings
From MaRDI portal
Publication:954954
DOI10.1016/j.jda.2006.10.003zbMath1162.68808OpenAlexW1977410585MaRDI QIDQ954954
W. F. Smyth, Jan Holub, Shu Wang
Publication date: 18 November 2008
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2006.10.003
Searching and sorting (68P10) Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10) Approximation algorithms (68W25)
Related Items (23)
Computing covers using prefix tables ⋮ An aperiodicity problem for multiwords ⋮ Covering problems for partial words and for indeterminate strings ⋮ Subset Seed Automaton ⋮ Indexing a sequence for mapping reads with a single mismatch ⋮ Indeterminate string inference algorithms ⋮ Constructing an indeterminate string from its associated graph ⋮ A simple fast hybrid pattern-matching algorithm ⋮ A new approach to regular \& indeterminate strings ⋮ Indeterminate strings, prefix arrays \& undirected graphs ⋮ Pattern Matching on Elastic-Degenerate Text with Errors ⋮ IDPM: An Improved Degenerate Pattern Matching Algorithm for Biological Sequences ⋮ Linear-time computation of prefix table for weighted strings {\&} applications ⋮ A prefix array for parameterized strings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A new approach to the periodicity lemma on strings with holes ⋮ Efficient pattern matching in elastic-degenerate strings ⋮ Approximate pattern matching on elastic-degenerate text ⋮ Unnamed Item ⋮ AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS ⋮ Elastic-Degenerate String Matching via Fast Matrix Multiplication ⋮ Order-preserving pattern matching indeterminate strings
Uses Software
Cites Work
This page was built for publication: Fast pattern-matching on indeterminate strings
