| Quick hypervolume LMS Russo, AP Francisco IEEE Transactions on Evolutionary Computation 18 (4), 481-502, 2013 | 125 | 2013 |
| Fully compressed suffix trees LMS Russo, G Navarro, AL Oliveira ACM transactions on algorithms (TALG) 7 (4), 1-34, 2011 | 80 | 2011 |
| Fully-compressed suffix trees LMS Russo, G Navarro, AL Oliveira LATIN 2008: Theoretical Informatics: 8th Latin American Symposium, Búzios
, 2008 | 57 | 2008 |
| Approximate string matching with compressed indexes LMS Russo, G Navarro, AL Oliveira, P Morales Algorithms 2 (3), 1105-1136, 2009 | 56 | 2009 |
| Space-efficient data-analysis queries on grids G Navarro, Y Nekrich, LMS Russo Theoretical Computer Science 482, 60-72, 2013 | 55 | 2013 |
| 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 | 41 | 2012 |
| A compressed self-index using a ZivLempel dictionary LMS Russo, AL Oliveira Information Retrieval 11 (4), 359-388, 2008 | 35 | 2008 |
| Re-pair Achieves High-Order Entropy. G Navarro, LMS Russo DCC, 537, 2008 | 35 | 2008 |
| Dynamic fully-compressed suffix trees LMS Russo, G Navarro, AL Oliveira Combinatorial Pattern Matching: 19th Annual Symposium, CPM 2008, Pisa, Italy
, 2008 | 29 | 2008 |
| Extending quick hypervolume LMS Russo, AP Francisco Journal of Heuristics 22, 245-271, 2016 | 28 | 2016 |
| Cartesian and Lyndon trees M Crochemore, LMS Russo Theoretical Computer Science 806, 1-9, 2020 | 21 | 2020 |
| Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER M Ferreira, N Roma, LMS Russo BMC bioinformatics 15, 1-13, 2014 | 16 | 2014 |
| 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 | 16 | 2011 |
| A compressed self-index using a Ziv-Lempel dictionary LMS Russo, AL Oliveira International Symposium on String Processing and Information Retrieval, 163-180, 2006 | 16 | 2006 |
| 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 | 15 | 2019 |
| Fast fully-compressed suffix trees G Navarro, LMS Russo 2014 Data Compression Conference, 283-291, 2014 | 14 | 2014 |
| Parallel and distributed compressed indexes LMS Russo, G Navarro, AL Oliveira Combinatorial Pattern Matching: 21st Annual Symposium, CPM 2010, New York
, 2010 | 12 | 2010 |
| Approximate string matching with Lempel-Ziv compressed indexes LMS Russo, G Navarro, AL Oliveira String Processing and Information Retrieval: 14th International Symposium
, 2007 | 10 | 2007 |
| Linking and cutting spanning trees LMS Russo, AS Teixeira, AP Francisco Algorithms 11 (4), 53, 2018 | 8 | 2018 |
| Monge properties of sequence alignment LMS Russo Theoretical computer science 423, 30-49, 2012 | 8 | 2012 |
