Incremental Multiple Longest Common Sub-Sequences
Abstract
We consider the problem of updating the information about multiple longest common sub-sequences. This kind of sub-sequences is used to highlight information that is shared across several information sequences, therefore it is extensively used namely in bioinformatics and computational genomics. In this paper we propose a way to maintain this information when the underlying sequences are subject to modifications, namely when letters are added and removed from the extremes of the sequence. Experimentally our data structure obtains significant improvements over the state of the art.
Keywords
Cite
@article{arxiv.2005.02725,
title = {Incremental Multiple Longest Common Sub-Sequences},
author = {Luís M. S. Russo and Alexandre P. Francisco and Tatiana Rocher},
journal= {arXiv preprint arXiv:2005.02725},
year = {2020}
}
Comments
The work reported in this article was supported by national funds through Funda\c{c}\~ao para a Ci\^encia e Tecnologia (FCT) through projects NGPHYLO PTDC/CCI-BIO/29676/2017 and UID/CEC/50021/2019. Funded in part by European Union Horizon 2020 research and innovation programme under the Marie Sk{\l}odowska-Curie Actions grant agreement No 690941