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
782013
Fully compressed suffix trees
LMS Russo, G Navarro, AL Oliveira
ACM transactions on algorithms (TALG) 7 (4), 1-34, 2011
692011
Approximate string matching with compressed indexes
L Russo, G Navarro, AL Oliveira, P Morales
Algorithms 2 (3), 1105-1136, 2009
542009
Fully-compressed suffix trees
LMS Russo, G Navarro, AL Oliveira
Latin American Symposium on Theoretical Informatics, 362-373, 2008
542008
Space-efficient data-analysis queries on grids
G Navarro, Y Nekrich, LMS Russo
Theoretical Computer Science 482, 60-72, 2013
532013
Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis
S Vinga, AM Carvalho, AP Francisco, LMS Russo, JS Almeida
Algorithms for Molecular Biology 7 (1), 1-12, 2012
342012
A compressed self-index using a Ziv–Lempel dictionary
LMS Russo, AL Oliveira
Information Retrieval 11 (4), 359-388, 2008
342008
Re-pair Achieves High-Order Entropy.
G Navarro, LMS Russo
DCC, 537, 2008
322008
Dynamic fully-compressed suffix trees
LMS Russo, G Navarro, AL Oliveira
Annual Symposium on Combinatorial Pattern Matching, 191-203, 2008
272008
Novel insights into endogenous RNA viral elements in Ixodes scapularis and other arbovirus vector genomes
AG Russo, AG Kelly, D Enosi Tuipulotu, MM Tanaka, PA White
Virus evolution 5 (1), vez010, 2019
162019
A compressed self-index using a Ziv-Lempel dictionary
LMS Russo, AL Oliveira
International Symposium on String Processing and Information Retrieval, 163-180, 2006
162006
Fast fully-compressed suffix trees
G Navarro, LMS Russo
2014 Data Compression Conference, 283-291, 2014
142014
Efficient alignment of pyrosequencing reads for re-sequencing applications
F Fernandes, PGS da Fonseca, LMS Russo, AL Oliveira, AT Freitas
BMC bioinformatics 12 (1), 1-9, 2011
142011
Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER
M Ferreira, N Roma, LMS Russo
BMC bioinformatics 15 (1), 1-13, 2014
132014
Extending quick hypervolume
LMS Russo, AP Francisco
Journal of Heuristics 22 (3), 245-271, 2016
122016
Parallel and distributed compressed indexes
LMS Russo, G Navarro, AL Oliveira
Annual Symposium on Combinatorial Pattern Matching, 348-360, 2010
112010
Approximate string matching with Lempel-Ziv compressed indexes
LMS Russo, G Navarro, AL Oliveira
International Symposium on String Processing and Information Retrieval, 264-275, 2007
102007
Cartesian and Lyndon trees
M Crochemore, LMS Russo
Theoretical Computer Science 806, 1-9, 2020
92020
An efficient algorithm for generating super condensed neighborhoods
LMS Russo, AL Oliveira
Annual Symposium on Combinatorial Pattern Matching, 104-115, 2005
72005
Indexed hierarchical approximate string matching
LMS 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