A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns
From MaRDI portal
Publication:5448657
DOI10.1007/978-3-540-77566-9_27zbMath1132.68381OpenAlexW1505200862MaRDI QIDQ5448657
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
Related Items
The swap matching problem revisited ⋮ A graph-theoretic model to solve the approximate string matching problem allowing for translocations ⋮ Finding patterns and periods in Cartesian tree matching ⋮ On a compact encoding of the swap automaton ⋮ Pattern Matching with Swaps for Short Patterns in Linear Time ⋮ Average-optimal string matching ⋮ Approximate periodicity
Cites Work