Luis Manuel Silveira Russo
Luis Manuel Silveira Russo
Подтвержден адрес электронной почты в домене ist.utl.pt
Название
Процитировано
Процитировано
Год
Quick hypervolume
LMS Russo, AP Francisco
IEEE Transactions on Evolutionary Computation 18 (4), 481-502, 2013
692013
Fully compressed suffix trees
LMS Russo, G Navarro, AL Oliveira
ACM transactions on algorithms (TALG) 7 (4), 1-34, 2011
662011
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
522013
A compressed self-index using a Ziv–Lempel dictionary
LMS Russo, AL Oliveira
Information Retrieval 11 (4), 359-388, 2008
342008
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), 10, 2012
322012
Re-pair Achieves High-Order Entropy.
G Navarro, LMS Russo
DCC, 537, 2008
302008
Dynamic fully-compressed suffix trees
LMS Russo, G Navarro, AL Oliveira
Annual Symposium on Combinatorial Pattern Matching, 191-203, 2008
272008
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), 163, 2011
142011
Extending quick hypervolume
LMS Russo, AP Francisco
Journal of Heuristics 22 (3), 245-271, 2016
112016
Fast fully-compressed suffix trees
G Navarro, LMS Russo
2014 Data Compression Conference, 283-291, 2014
112014
Parallel and distributed compressed indexes
LMS Russo, G Navarro, AL Oliveira
Annual Symposium on Combinatorial Pattern Matching, 348-360, 2010
112010
Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER
M Ferreira, N Roma, LMS Russo
BMC bioinformatics 15 (1), 165, 2014
102014
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
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
Cartesian and Lyndon trees
M Crochemore, LMS Russo
Theoretical Computer Science 806, 1-9, 2020
52020
Managing and querying a bilingual lexicon with suffix trees
J Costa, L Gomes, GP Lopes, LMS Russo
Proceedings of the 15th Portuguese Conference in Arificial Intelligence …, 2011
52011
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20