Speeding up transposition-invariant string matching

DOI10.1016/J.IPL.2006.04.018MaRDI QIDQ845816zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmslongest common subsequenceinformation retrievallongest common transposition-invariant subsequencetransposition invariance

Mathematics Subject Classification ID

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

Recommendations

• String Processing and Information Retrieval
• Practical algorithms for transposition-invariant string-matching
• Transposition invariant string matching
• Computing the Longest Common Transposition-Invariant Subsequence with GPU
• scientific article; zbMATH DE number 1962813

Cites work

• scientific article; zbMATH DE number 1962813 (Why is no real title available?)
• scientific article; zbMATH DE number 1998339 (Why is no real title available?)
• A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
• A fast algorithm for computing longest common subsequences
• Design and implementation of an efficient priority queue
• Practical algorithms for transposition-invariant string-matching
• Preserving order in a forest in less than logarithmic time and linear space
• Transposition invariant string matching

Cited in

(10)

• String Processing and Information Retrieval
• New tabulation and sparse dynamic programming based techniques for sequence similarity problems
• scientific article; zbMATH DE number 2111729 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 1962813 (Why is no real title available?)

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)