Speeding up transposition-invariant string matching
From MaRDI portal
Publication:845816
DOI10.1016/J.IPL.2006.04.018zbMATH Open1185.68305OpenAlexW2011839096MaRDI QIDQ845816FDOQ845816
Authors: Sebastian Deorowicz
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
Recommendations
algorithmslongest common subsequenceinformation retrievallongest common transposition-invariant subsequencetransposition invariance
Cites Work
- Preserving order in a forest in less than logarithmic time and linear space
- 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
- Practical algorithms for transposition-invariant string-matching
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- String Processing and Information Retrieval
- New tabulation and sparse dynamic programming based techniques for sequence similarity problems
- Title not available (Why is that?)
- Practical algorithms for transposition-invariant string-matching
- Transposition invariant string matching
- Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time
- Efficient string-matching allowing for non-overlapping inversions
- An artificial neural network based approach for online string matching/filtering of large databases
- Bit-parallel algorithms for the merged longest common subsequence problem
- Title not available (Why is that?)
This page was built for publication: Speeding up transposition-invariant string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845816)