Average-Case Optimal Approximate Circular String Matching
From MaRDI portal
Publication:2799164
DOI10.1007/978-3-319-15579-1_6zbMath1451.68355arXiv1406.5480OpenAlexW1877114054MaRDI QIDQ2799164
Costas S. Iliopoulos, Carl Barton, Solon P. Pissis
Publication date: 8 April 2016
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.5480
approximate string matchingaverage-case complexityalgorithms on automata and wordsaverage-case optimal
Related Items (7)
Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions ⋮ Bit-Parallel Approximate Matching of Circular Strings with k Mismatches ⋮ Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment ⋮ Fast circular dictionary-matching algorithm ⋮ Searching and Indexing Circular Patterns ⋮ Circular pattern matching with \(k\) mismatches ⋮ Quasi-Linear-Time Algorithm for Longest Common Circular Factor
This page was built for publication: Average-Case Optimal Approximate Circular String Matching