Volgen
Luis Manuel Silveira Russo
Luis Manuel Silveira Russo
Geverifieerd e-mailadres voor ist.utl.pt
Titel
Geciteerd door
Geciteerd door
Jaar
Quick hypervolume
LMS Russo, AP Francisco
IEEE Transactions on Evolutionary Computation 18 (4), 481-502, 2013
1182013
Fully compressed suffix trees
LMS Russo, G Navarro, AL Oliveira
ACM transactions on algorithms (TALG) 7 (4), 1-34, 2011
802011
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
LMS Russo, G Navarro, AL Oliveira
LATIN 2008: Theoretical Informatics: 8th Latin American Symposium, Búzios …, 2008
552008
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-12, 2012
412012
A compressed self-index using a Ziv–Lempel dictionary
LMS Russo, AL Oliveira
Information Retrieval 11 (4), 359-388, 2008
352008
Re-pair Achieves High-Order Entropy.
G Navarro, LMS Russo
DCC, 537, 2008
342008
Dynamic fully-compressed suffix trees
LMS Russo, G Navarro, AL Oliveira
Combinatorial Pattern Matching: 19th Annual Symposium, CPM 2008, Pisa, Italy …, 2008
282008
Extending quick hypervolume
LMS Russo, AP Francisco
Journal of Heuristics 22, 245-271, 2016
262016
Cartesian and Lyndon trees
M Crochemore, LMS Russo
Theoretical Computer Science 806, 1-9, 2020
192020
Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER
M Ferreira, N Roma, LMS Russo
BMC bioinformatics 15, 1-13, 2014
162014
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
Efficient alignment of pyrosequencing reads for re-sequencing applications
F Fernandes, PGS da Fonseca, LMS Russo, AL Oliveira, AT Freitas
BMC bioinformatics 12, 1-9, 2011
152011
Fast fully-compressed suffix trees
G Navarro, LMS Russo
2014 Data Compression Conference, 283-291, 2014
142014
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
132019
Parallel and distributed compressed indexes
LMS Russo, G Navarro, AL Oliveira
Combinatorial Pattern Matching: 21st Annual Symposium, CPM 2010, New York …, 2010
122010
Approximate string matching with Lempel-Ziv compressed indexes
LMS Russo, G Navarro, AL Oliveira
String Processing and Information Retrieval: 14th International Symposium …, 2007
102007
Linking and cutting spanning trees
LMS Russo, AS Teixeira, AP Francisco
Algorithms 11 (4), 53, 2018
82018
A study on splay trees
LMS Russo
Theoretical Computer Science 776, 1-18, 2019
72019
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20