Follow
Luis Manuel Silveira Russo
Luis Manuel Silveira Russo
Verified email at ist.utl.pt
Title
Cited by
Cited by
Year
Quick hypervolume
LMS Russo, AP Francisco
IEEE Transactions on Evolutionary Computation 18 (4), 481-502, 2013
1012013
Fully compressed suffix trees
LMS Russo, G Navarro, AL Oliveira
ACM transactions on algorithms (TALG) 7 (4), 1-34, 2011
712011
Approximate string matching with compressed indexes
LMS Russo, G Navarro, AL Oliveira, P Morales
Algorithms 2 (3), 1105-1136, 2009
562009
Space-efficient data-analysis queries on grids
G Navarro, Y Nekrich, LMS Russo
Theoretical Computer Science 482, 60-72, 2013
552013
Fully-compressed suffix trees
L Russo, G Navarro, AL Oliveira
Latin American Symposium on Theoretical Informatics, 362-373, 2008
542008
Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis
S Vinga, AM Carvalho, AP Francisco, L Russo, JS Almeida
Algorithms for Molecular Biology 7 (1), 1-12, 2012
382012
A compressed self-index using a Ziv–Lempel dictionary
L Russo, AL Oliveira
Information Retrieval 11 (4), 359-388, 2008
362008
Re-pair Achieves High-Order Entropy.
G Navarro, LMS Russo
DCC, 537, 2008
342008
Dynamic fully-compressed suffix trees
L Russo, G Navarro, AL Oliveira
Annual Symposium on Combinatorial Pattern Matching, 191-203, 2008
282008
Extending quick hypervolume
L Russo, AP Francisco
Journal of Heuristics 22 (3), 245-271, 2016
202016
A compressed self-index using a Ziv-Lempel dictionary
L Russo, AL Oliveira
International Symposium on String Processing and Information Retrieval, 163-180, 2006
162006
Cartesian and Lyndon trees
M Crochemore, LMS Russo
Theoretical Computer Science 806, 1-9, 2020
152020
Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER
M Ferreira, N Roma, L Russo
BMC bioinformatics 15 (1), 1-13, 2014
142014
Efficient alignment of pyrosequencing reads for re-sequencing applications
F Fernandes, PGS da Fonseca, L Russo, AL Oliveira, AT Freitas
BMC bioinformatics 12 (1), 1-9, 2011
142011
Fast fully-compressed suffix trees
G Navarro, LMS Russo
2014 Data Compression Conference, 283-291, 2014
132014
Parallel and distributed compressed indexes
L Russo, G Navarro, AL Oliveira
Annual Symposium on Combinatorial Pattern Matching, 348-360, 2010
122010
Approximate string matching with Lempel-Ziv compressed indexes
L Russo, G Navarro, AL Oliveira
International Symposium on String Processing and Information Retrieval, 264-275, 2007
102007
Flying tourist problem: Flight time and cost minimization in complex routes
R Marques, L Russo, N Roma
Expert Systems with Applications 130, 172-187, 2019
82019
An efficient algorithm for generating super condensed neighborhoods
L Russo, AL Oliveira
Annual Symposium on Combinatorial Pattern Matching, 104-115, 2005
72005
Indexed hierarchical approximate string matching
L Russo, G Navarro, AL Oliveira
International Symposium on String Processing and Information Retrieval, 144-154, 2008
62008
The system can't perform the operation now. Try again later.
Articles 1–20