Speeding up transposition-invariant string matching

DOI10.1016/j.ipl.2006.04.018zbMath1185.68305OpenAlexW2011839096MaRDI QIDQ845816

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

zbMATH Keywords

algorithmsinformation retrievallongest common subsequencelongest common transposition-invariant subsequencetransposition invariance

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Related Items (3)

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 ⋮ BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Speeding up transposition-invariant string matching