A new algorithm for efficient pattern matching with swaps

DOI10.1007/978-3-642-10217-2_24MaRDI QIDQ3651549zbMATH OpenOpenAlexFDO

Authors Matteo Campanelli, Domenico Cantone, Simone Faro

Publication date 11 December 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-642-10217-2_24

zbMATH Keywords

combinatorial algorithms on wordsdesign and analysis of algorithmsnonstandard pattern matchingpattern matching with swaps

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Pattern matching with swaps in practice
• Pattern Matching with Swaps for Short Patterns in Linear Time
• Pattern Matching with Swaps
• The swap matching problem revisited
• A simple streaming bit-parallel algorithm for swap pattern matching

Cited in

(12)

• Overlap matching.
• Approximate periodicity
• On a compact encoding of the swap automaton
• A weak approach to suffix automata simulation for exact and approximate string matching
• Pattern matching with swaps in practice
• Efficient special cases of pattern matching with swaps
• The swap matching problem revisited
• Pattern Matching with Swaps for Short Patterns in Linear Time
• Pattern Matching with Swaps
• A simple streaming bit-parallel algorithm for swap pattern matching
• Efficient Algorithms for the Spoonerism Problem
• A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns

This page was built for publication: A new algorithm for efficient pattern matching with swaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3651549)