scientific article

From MaRDI portal

Publication:3104398

Jump to:navigation, search

zbMath1244.68037MaRDI QIDQ3104398

V. Yu. Popov

Publication date: 19 December 2011

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

zbMATH Keywords

NP-complete longest common subsequence sequence annotation

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3104398&oldid=29982392"