Set intersection and sequence matching with mismatch counting

DOI10.1016/j.tcs.2016.01.003zbMath1344.68315OpenAlexW2237665886MaRDI QIDQ294918

Ely Porat, Ariel Shiftan

Publication date: 16 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.003

zbMATH Keywords

pattern matchinggeneralized stringssequence matchingset intersection matching

Mathematics Subject Classification ID

Randomized algorithms (68W20) Algorithms on strings (68W32)

Related Items (1)

A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple deterministic wildcard matching
• On improving the worst case running time of the Boyer-Moore string matching algorithm
• Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
• Verifying candidate matches in sparse and wildcard matching
• Fast Pattern Matching in Strings
• Tree Pattern Matching to Subset Matching in Linear Time
• Combinatorial Pattern Matching
• Combinatorial Pattern Matching

This page was built for publication: Set intersection and sequence matching with mismatch counting