Pattern Matching with Swaps for Short Patterns in Linear Time

DOI10.1007/978-3-540-95891-8_25zbMath1206.68376OpenAlexW1577768827MaRDI QIDQ3599078

Domenico Cantone, Simone Faro

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_25

zbMATH Keywords

combinatorial algorithms on wordspattern matching with swapsdesign and analysis of algorithmsnonstandard pattern matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (4)

The swap matching problem revisited ⋮ A weak approach to suffix automata simulation for exact and approximate string matching ⋮ Quantum string matching unfolded and extended ⋮ On a compact encoding of the swap automaton

Cites Work

• Efficient special cases of pattern matching with swaps
• Overlap matching.
• Approximate swapped matching.
• Pattern Matching with Swaps
• A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns

This page was built for publication: Pattern Matching with Swaps for Short Patterns in Linear Time