×

Found 7 Documents (Results 1–7)

Approximating approximate pattern matching. (English) Zbl 07559183

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 15, 13 p. (2019).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

Order-preserving pattern matching indeterminate strings. (English) Zbl 1497.68602

Navarro, Gonzalo (ed.) et al., 29th annual symposium on combinatorial pattern matching, CPM 2018, July 2–4, 2018, Qingdao, China. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 105, Article 2, 15 p. (2018).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

A simple algorithm for approximating the text-to-pattern Hamming distance. (English) Zbl 1433.68633

Seidel, Raimund (ed.), 1st symposium on simplicity in algorithms. SOSA 2018, January 7–10, 2018, New Orleans, LA, USA. Co-located with the 29th ACM-SIAM symposium on discrete algorithms (SODA 2018). Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 61, Article 10, 5 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Software