Algorithms for transposition invariant string matching

DOI10.1007/3-540-36494-3_18MaRDI QIDQ4418649zbMATH OpenFDO

Authors Veli Mäkinen, Esko Ukkonen, Gonzalo Navarro

Publication date 11 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2607/26070191.htm

zbMATH Keywords

music information retrieval

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Transposition invariant string matching
• Speeding up transposition-invariant string matching
• Practical algorithms for transposition-invariant string-matching
• scientific article; zbMATH DE number 3845091
• Bit-parallel approximate string matching algorithms with transposition

Cited in

(9)

• On minimizing pattern splitting in multi-track string matching
• Practical algorithms for transposition-invariant string-matching
• String comparison by transposition networks
• Efficient string-matching allowing for non-overlapping inversions
• A graph-theoretic model to solve the approximate string matching problem allowing for translocations
• Transposition invariant string matching
• An efficient algorithm for computing non-overlapping inversion and transposition distance
• Speeding up transposition-invariant string matching
• Fast algorithms for finding disjoint subsequences with extremal densities

This page was built for publication: Algorithms for transposition invariant string matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418649)