A graph approach to the threshold all-against-all substring matching problem

DOI10.1145/1227161.1370601MaRDI QIDQ5269280zbMATH OpenOpenAlexFDO

Authors Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton

Publication date 15 June 2017

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1227161.1370601

zbMATH Keywords

complexitybioinformaticsstring matching

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Analysis of algorithms (68W40) Algorithms on strings (68W32)

Recommendations

• On all-substrings alignment problems
• Combinatorial Pattern Matching
• On approximate pattern matching with thresholds
• scientific article; zbMATH DE number 1445379
• Boyer-Moore approach to approximate string matching

Cited in

(1)

• scientific article; zbMATH DE number 2114411 (Why is no real title available?)

This page was built for publication: A graph approach to the threshold all-against-all substring matching problem

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