???global.info.a_carregar???
Luís Manuel Silveira Russo.
Identificação

Identificação pessoal

Nome completo
Luís Manuel Silveira Russo

Nomes de citação

  • Russo, Luís

Identificadores de autor

Ciência ID
BF13-A6A6-D094
ORCID iD
0000-0002-1966-1808

Websites

Idiomas

Idioma Conversação Leitura Escrita Compreensão Peer-review
Português Utilizador proficiente (C1) Utilizador proficiente (C1) Utilizador proficiente (C1) Utilizador proficiente (C1)
Inglês Utilizador proficiente (C1) Utilizador proficiente (C1) Utilizador independente (B1) Utilizador proficiente (C1)
Formação
Grau Classificação
2007
Concluído
 DEIC (Doutoramento)
Universidade de Lisboa Instituto Superior Técnico, Portugal
"Enhanced Full-Text Self-Indexes based on Lempel-Ziv Compression" (TESE/DISSERTAÇÃO)
 Aproved
2003
Concluído
 LMAC (Licenciatura)
Universidade de Lisboa Instituto Superior Técnico, Portugal
"Algebra in a Topos" (TESE/DISSERTAÇÃO)
 18
Percurso profissional

Docência no Ensino Superior

Categoria Profissional
Instituição de acolhimento 		Empregador
2010/09/01 - Atual Professor Auxiliar (Docente Universitário) Universidade de Lisboa Instituto Superior Técnico, Portugal
Projetos

Projeto

Designação Financiadores
2016/01/01 - 2019/12/31 Bioinformatics and Information Retrieval Data Structures Analysis and Design
Sklodowska-Curie grant agreement No 690941
Investigador responsável
Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento em Lisboa, Portugal
Concluído
Produções

Publicações

Artigo em conferência
  1. Navarro, G.; Russo, L.M.S.. "Fast fully-compressed suffix trees". 2014.
    10.1109/DCC.2014.40
Artigo em revista
  1. Luís M.S. Russo. "Searching for a Feedback Vertex Set with the link-cut tree". Journal of Computational Science (2023): https://doi.org/10.1016/j.jocs.2023.102110.
    10.1016/j.jocs.2023.102110
  2. João Nuno Ferreira Alves; Luís Manuel Silveira Russo; Alexandre Francisco. "Cache-oblivious Hilbert Curve-based Blocking Scheme for Matrix Transposition". ACM Transactions on Mathematical Software (2022): https://doi.org/10.1145/3555353.
    10.1145/3555353
  3. Luís M.S. Russo; Diogo Costa; Rui Henriques; Hideo Bannai; Alexandre P. Francisco. "Order-preserving pattern matching indeterminate strings". Information and Computation (2022): https://doi.org/10.1016/j.ic.2022.104924.
    10.1016/j.ic.2022.104924
  4. Luís M.S. Russo; Daniel Castro; Aleksandar Ilic; Paolo Romano; Ana D. Correia. "Stochastic simulated annealing for directed feedback vertex set". Applied Soft Computing (2022): https://doi.org/10.1016/j.asoc.2022.109607.
    10.1016/j.asoc.2022.109607
  5. Miguel E. Coimbra; Joana Hrotkó; Alexandre P. Francisco; Luís M.S. Russo; Guillermo de Bernardo; Susana Ladra; Gonzalo Navarro. "A practical succinct dynamic graph representation". Information and Computation (2021): https://doi.org/10.1016/j.ic.2021.104862.
    10.1016/j.ic.2021.104862
  6. Luis Russo; Alexandre Francisco. "Small Longest Tandem Scattered Subsequences". Scientific Annals of Computer Science (2021): https://doi.org/10.7561/SACS.2021.1.79.
    10.7561/SACS.2021.1.79
  7. Luís M.S. Russo; Tobias Dietz; José Rui Figueira; Alexandre P. Francisco; Stefan Ruzika. "Sparsifying parity-check matrices". Applied Soft Computing 96 (2020): 106601-106601. https://doi.org/10.1016/j.asoc.2020.106601.
    10.1016/j.asoc.2020.106601
  8. Hideo Bannai; Travis Gagie; Gary Hoppenworth; Simon J. Puglisi; Luís M. S. Russo. "More Time-Space Tradeoffs for Finding a Shortest Unique Substring". Algorithms (2020): https://doi.org/10.3390/a13090234.
    10.3390/a13090234
  9. Luís M.S. Russo. "A study on splay trees". Theoretical Computer Science 776 (2019): 1-18. https://doi.org/10.1016/j.tcs.2018.12.020.
    10.1016/j.tcs.2018.12.020
  10. Russo, L.M.S.; Francisco, A.P.. "Extending quick hypervolume". Journal of Heuristics 22 3 (2016): 245-271. http://www.scopus.com/inward/record.url?eid=2-s2.0-84960390174&partnerID=MN8TOARS.
    10.1007/s10732-016-9309-6
  11. Ferreira, M.; Roma, N.; Russo, L.M.S.. "Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER". BMC Bioinformatics 15 1 (2014): http://www.scopus.com/inward/record.url?eid=2-s2.0-84904541795&partnerID=MN8TOARS.
    10.1186/1471-2105-15-165
  12. Russo, L.M.S.; Francisco, A.P.. "Quick hypervolume". IEEE Transactions on Evolutionary Computation 18 4 (2014): 481-502. http://www.scopus.com/inward/record.url?eid=2-s2.0-84905566775&partnerID=MN8TOARS.
    10.1109/TEVC.2013.2281525
  13. Coimbra, M.E.; Fernandes, F.; Russo, L.M.S.; Freitas, A.T.. "Parallel efficient aligner of pyrosequencing reads". ACM International Conference Proceeding Series (2013): 241-246. http://www.scopus.com/inward/record.url?eid=2-s2.0-84886259090&partnerID=MN8TOARS.
    10.1145/2488551.2488593
  14. Costa, J.; Gomes, L.; Lopes, G.P.; Russo, L.M.S.; Brisaboa, N.R.. "Compact and fast indexes for translation related tasks". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8154 LNAI (2013): 504-515. http://www.scopus.com/inward/record.url?eid=2-s2.0-84884721842&partnerID=MN8TOARS.
    10.1007/978-3-642-40669-0_43
  15. Navarro, G.; Nekrich, Y.; Russo, L.M.S.. "Space-efficient data-analysis queries on grids". Theoretical Computer Science 482 (2013): 60-72. http://www.scopus.com/inward/record.url?eid=2-s2.0-84876406405&partnerID=MN8TOARS.
    10.1016/j.tcs.2012.11.031
  16. Russo, L.M.S.. "Monge properties of sequence alignment". Theoretical Computer Science 423 (2012): 30-49. http://www.scopus.com/inward/record.url?eid=2-s2.0-84857045742&partnerID=MN8TOARS.
    10.1016/j.tcs.2011.12.068
  17. Vinga, S.; Carvalho, A.M.; Francisco, A.P.; Russo, L.M.S.; Almeida, J.S.. "Pattern matching through Chaos Game Representation: Bridging numerical and discrete data structures for biological sequence analysis". Algorithms for Molecular Biology 7 1 (2012): http://www.scopus.com/inward/record.url?eid=2-s2.0-84860351022&partnerID=MN8TOARS.
    10.1186/1748-7188-7-10
  18. Costa, J.; Lopes, G.P.; Gomes, L.; Russo, L.M.S.. "Representing a bilingual lexicon with suffix trees". Proceedings of the ACM Symposium on Applied Computing (2011): 1164-1165. http://www.scopus.com/inward/record.url?eid=2-s2.0-79959307317&partnerID=MN8TOARS.
    10.1145/1982185.1982440
  19. Fernandes, F.; da Fonseca, P.G.S.; Russo, L.M.S.; Oliveira, A.L.; Freitas, A.T.. "Efficient alignment of pyrosequencing reads for re-sequencing applications". BMC Bioinformatics 12 (2011): http://www.scopus.com/inward/record.url?eid=2-s2.0-79958812542&partnerID=MN8TOARS.
    10.1186/1471-2105-12-163
  20. Russo, L.M.S.; Tischler, G.. "Succinct gapped suffix arrays". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7024 LNCS (2011): 290-294. http://www.scopus.com/inward/record.url?eid=2-s2.0-80053943750&partnerID=MN8TOARS.
    10.1007/978-3-642-24583-1_28
  21. Russo, L.M.S.; Navarro, G.; Oliveira, A.L.. "Fully compressed suffix trees". ACM Transactions on Algorithms 7 4 (2011): http://www.scopus.com/inward/record.url?eid=2-s2.0-80053483441&partnerID=MN8TOARS.
    10.1145/2000807.2000821
  22. Navarro, G.; Russo, L.M.S.. "Space-efficient data-analysis queries on grids". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7074 LNCS (2011): 323-332. http://www.scopus.com/inward/record.url?eid=2-s2.0-84055217312&partnerID=MN8TOARS.
    10.1007/978-3-642-25591-5_34
  23. Russo, L.M.S.; Navarro, G.; Oliveira, A.L.. "Parallel and distributed compressed indexes". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6129 LNCS (2010): 348-360. http://www.scopus.com/inward/record.url?eid=2-s2.0-78449285588&partnerID=MN8TOARS.
    10.1007/978-3-642-13509-5_31
  24. Russo, L.M.S.. "Multiplication algorithms for monge matrices". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6393 LNCS (2010): 94-105. http://www.scopus.com/inward/record.url?eid=2-s2.0-78449283504&partnerID=MN8TOARS.
    10.1007/978-3-642-16321-0_9
  25. Russo, L.M.S.; Navarro, G.; Oliveira, A.L.; Morales, P.. "Approximate string matching with compressed indexes". Algorithms 2 3 (2009): 1105-1136. http://www.scopus.com/inward/record.url?eid=2-s2.0-78449269708&partnerID=MN8TOARS.
    10.3390/a2031105
  26. Russo, L.M.S.; Navarro, G.; Oliveira, A.L.. "Fully-compressed suffix trees". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4957 LNCS (2008): 362-373. http://www.scopus.com/inward/record.url?eid=2-s2.0-43049087046&partnerID=MN8TOARS.
    10.1007/978-3-540-78773-0_32
  27. Russo, L.M.S.; Oliveira, A.L.. "A compressed self-index using a Ziv-Lempel dictionary". Information Retrieval 11 4 (2008): 359-388. http://www.scopus.com/inward/record.url?eid=2-s2.0-43949107477&partnerID=MN8TOARS.
    10.1007/s10791-008-9050-3
  28. Russo, L.M.S.; Navarro, G.; Oliveira, A.L.. "Dynamic fully-compressed suffix trees". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5029 LNCS (2008): 191-203. http://www.scopus.com/inward/record.url?eid=2-s2.0-45849125001&partnerID=MN8TOARS.
    10.1007/978-3-540-69068-9_19
  29. Russo, L.M.S.; Navarro, G.; Oliveira, A.L.. "Indexed hierarchical approximate string matching". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5280 LNCS (2008): 144-154. http://www.scopus.com/inward/record.url?eid=2-s2.0-58149084166&partnerID=MN8TOARS.
    10.1007/978-3-540-89097-3-15
  30. Russo, L.M.S.; Navarro, G.; Oliveira, A.L.. "Approximate string matching with Lempel-Ziv compressed indexes". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4726 LNCS (2007): 264-275. http://www.scopus.com/inward/record.url?eid=2-s2.0-38049048329&partnerID=MN8TOARS.
  31. Russo, L.M.S.; Oliveira, A.L.. "Efficient generation of super condensed neighborhoods". Journal of Discrete Algorithms 5 3 (2007): 501-513. http://www.scopus.com/inward/record.url?eid=2-s2.0-34248641698&partnerID=MN8TOARS.
    10.1016/j.jda.2006.10.005
  32. Russo, L.M.S.; Oliveira, A.L.. "A compressed self-index using a Ziv-Lempel dictionary". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4209 LNCS (2006): 163-180. http://www.scopus.com/inward/record.url?eid=2-s2.0-33750283805&partnerID=MN8TOARS.
  33. Russo, L.M.S.; Oliveira, A.L.. "Faster generation of super condensed neighbourhoods using finite automata". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3772 LNCS (2005): 246-255. http://www.scopus.com/inward/record.url?eid=2-s2.0-33646751474&partnerID=MN8TOARS.
    10.1007/11575832_28
  34. Russo, L.M.S.; Oliveira, A.L.. "An efficient algorithm for generating Super Condensed Neighborhoods". Lecture Notes in Computer Science 3537 (2005): 104-115. http://www.scopus.com/inward/record.url?eid=2-s2.0-26444574213&partnerID=MN8TOARS.
Livro
  1. Costa, J.; Gomes, L.; Lopes, G.P.; Russo, L.M.S.. Improving bilingual search performance using compact full-text Indices. 2015.
    10.1007/978-3-319-18111-0_44