A graph approach to the threshold all-against-all substring matching problem
From MaRDI portal
Publication:5269280
DOI10.1145/1227161.1370601zbMATH Open1365.68504OpenAlexW2086354937MaRDI QIDQ5269280FDOQ5269280
Ulrike Stege, Alex Thomo, Chris Upton, Marina Barsky
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
Protein sequences, DNA sequences (92D20) Analysis of algorithms (68W40) Algorithms on strings (68W32)
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)
