scientific article; zbMATH DE number 7651116

DOI10.4230/LIPIcs.CPM.2020.25MaRDI QIDQ5874455

Kristoffer Sahlin, Veli Mäkinen

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/2001.06864

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

chaininglongest common subsequencesparse dynamic programmingmaximal exact matches

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (1)

Sequence to graph alignment using gap-sensitive co-linear chaining

This page was built for publication: