The longest filled common subsequence problem

Castelli, M., Dondi, R., Mauri, G., & Zoppis, I. (2017). The longest filled common subsequence problem. In 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017 (Vol. 78). [14] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs....

ver descrição completa

Detalhes bibliográficos
Autor principal: Castelli, Mauro (author)
Outros Autores: Dondi, Riccardo (author), Mauri, Giancarlo (author), Zoppis, Italo (author)
Formato: conferenceObject
Idioma:eng
Publicado em: 2018
Assuntos:
Approximation algorithms
Computational complexity
Fixed-parameter algorithms
Longest common subsequence
Software
Texto completo:https://doi.org/10.4230/LIPIcs.CPM.2017.14
País:Portugal
Oai:oai:run.unl.pt:10362/28045

Texto Completo

https://doi.org/10.4230/LIPIcs.CPM.2017.14

Registos relacionados