Speeding up transposition-invariant string matching
From MaRDI portal
Publication:845816
DOI10.1016/j.ipl.2006.04.018zbMath1185.68305MaRDI QIDQ845816
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.04.018
algorithms; information retrieval; longest common subsequence; longest common transposition-invariant subsequence; transposition invariance
Related Items
BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM, New tabulation and sparse dynamic programming based techniques for sequence similarity problems, An artificial neural network based approach for online string matching/filtering of large databases
Cites Work
- Unnamed Item
- Unnamed Item
- Preserving order in a forest in less than logarithmic time and linear space
- Practical algorithms for transposition-invariant string-matching
- A fast algorithm for computing longest common subsequences
- Design and implementation of an efficient priority queue
- A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
- Transposition invariant string matching