Dynamic String Alignment.

DOI10.4230/LIPICS.CPM.2020.9MaRDI QIDQ5874435zbMATH OpenOpenAlexFDO

Authors Panagiotis Charalampopoulos, Tomasz Kociumaka, Shay Mozes

Publication date 7 February 2023

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2020/12134/pdf/LIPIcs-CPM-2020-9.pdf/

zbMATH Keywords

(unit-)Monge matrices\((\min,+)\)-productedit distancelongest common subsequencestring alignment

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(7)

• scientific article; zbMATH DE number 6850408 (Why is no real title available?)
• Matching patterns with variables under edit distance
• Longest bordered and periodic subsequences
• A textbook solution for dynamic strings
• An almost optimal edit distance oracle
• Bounded weighted edit distance: dynamic algorithms and matching lower bounds
• Core-sparse Monge matrix multiplication: improved algorithm and applications

This page was built for publication: Dynamic String Alignment.

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