On Minimizing Pattern Splitting in Multi-track String Matching

DOI10.1007/3-540-44888-8_18zbMATH Open1279.68370OpenAlexW2138356982MaRDI QIDQ3550839FDOQ3550839

Authors: Kjell Lemström, Veli Mäkinen 

Publication date: 6 April 2010

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-44888-8_18

Recommendations

• On minimizing pattern splitting in multi-track string matching
• Permuted pattern matching algorithms on multi-track strings
• Permuted Pattern Matching on Multi-track Strings
• scientific article; zbMATH DE number 2111729
• scientific article; zbMATH DE number 3911754
• Optimal parallel pattern matching in strings
• Average-optimal multiple approximate string matching
• Average-optimal single and multiple approximate string matching
• On String Matching in Chunked Texts

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited In (2)

• On minimizing pattern splitting in multi-track string matching
• Permuted Pattern Matching on Multi-track Strings

This page was built for publication: On Minimizing Pattern Splitting in Multi-track String Matching

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