A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns

DOI10.1007/978-3-540-77566-9_27zbMATH Open1132.68381OpenAlexW1505200862MaRDI QIDQ5448657FDOQ5448657

Authors: Costas S. Iliopoulos, M. Sohel Rahman 

Publication date: 7 March 2008

Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_27

Recommendations

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Computational and Information Science
• Overlap matching.
• Approximate swapped matching.
• Efficient special cases of pattern matching with swaps
• Title not available (Why is that?)
• Pattern Matching with Swaps

Cited In (8)

• Pattern Matching with Swaps for Short Patterns in Linear Time
• A graph-theoretic model to solve the approximate string matching problem allowing for translocations
• On a compact encoding of the swap automaton
• The swap matching problem revisited
• Average-optimal string matching
• Approximate periodicity
• Finding patterns and periods in Cartesian tree matching
• A simple streaming bit-parallel algorithm for swap pattern matching

This page was built for publication: A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns

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