18 citations · 20 across the 9 of their papers we have counts for
7 papers · 1 filter
Small Longest Tandem Scattered Subsequences
Luís M. S. Russo, Alexandre P. Francisco
We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string.…
Distance-based phylogenetic inference from typing data: a unifying view
Cátia Vaz, Marta Nascimento, João A. Carriço +2
Typing methods are widely used in the surveillance of infectious diseases, outbreaks investigation and studies of the natural history of an infection. And their use is becoming sta…
Incremental Multiple Longest Common Sub-Sequences
Luís M. S. Russo, Alexandre P. Francisco, Tatiana Rocher
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 s…
Approximating Optimal Bidirectional Macro Schemes
Luís M. S. Russo, Ana D. Correia, Gonzalo Navarro +1
Lempel-Ziv is an easy-to-compute member of a wide family of so-called macro schemes; it restricts pointers to go in one direction only. Optimal bidirectional macro schemes are NP-c…
On dynamic succinct graph representations
Miguel E. Coimbra, Alexandre P. Francisco, Luís M. S. Russo +3
We address the problem of representing dynamic graphs using -trees. The -tree data structure is one of the succinct data structures proposed for representing static graph…
Order-Preserving Pattern Matching Indeterminate Strings
Diogo Costa, Luís M. S. Russo, Rui Henriques +2
Given an indeterminate string pattern and an indeterminate string text , the problem of order-preserving pattern matching with character uncertainties (OPPM) is to find a…