[1]	Miguel Coimbra, Francisco Fernandes, Luís M. S. Russo, and Ana T. Freitas. Parallel efficient aligner of pyrosequencing reads. COST Action SeqAhead Workshop, 2013. Poster. [ bib ]
[2]	Luís M. S. Russo and Alexandre P. Francisco. Quick HyperVolume. Submitted to IEEE Transactions on Evolutionary Computation, July 2012. [ bib \| arXiv ] Keywords: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, Computer Science - Neural and Evolutionary Computing
[3]	Luís M.S. and Russo. Monge properties of sequence alignment. Theoretical Computer Science, 423(0):30 - 49, 2012. [ bib \| DOI \| DOI \| http ]
[4]	Susana Vinga, Alexandra Carvalho, Alexandre Francisco, Luís Russo, and Jonas Almeida. Pattern matching through chaos game representation: bridging numerical and discrete data structures for biological sequence analysis. Algorithms for Molecular Biology, 7(1):10, 2012. [ bib \| DOI \| DOI \| http ]
[5]	Gonzalo Navarro, Yakov Nekrich, and Luís M.S. Russo. Space-efficient data-analysis queries on grids. Theoretical Computer Science, 1, 2012. [ bib \| DOI \| DOI \| http ]
[6]	Arlindo L. Oliveira Luís M. S. Russo, Ana T. Freitas. Transparent hidden Markov models. Neural Information Processing Systems, 2012. Poster. [ bib ]
[7]	Francisco Fernandes, Paulo G. S. Fonseca, Luís M. S. Russo, Arlindo L. Oliveira, and Ana T. Freitas. Tapyr - an efficient high-throughput sequence aligner for re-sequencing applications. Paris, France. GDR CNRS 3003 Bioinformatique Moléculaire, 2012. Poster. [ bib ]
[8]	Francisco Fernandes, Paulo G. S. Fonseca, Luis M. S. Russo, Arlindo L. Oliveira, and Ana T. Freitas. An efficient data representation for large scale genome re-sequencing. 13th International Meeting on Human Genome Variation and Complex Genome Analysis, 2012. Poster. [ bib ]
[9]	Francisco Fernandes, Paulo G. S. da Fonseca, Luís M. S. Russo, Arlindo L. Oliveira, and Ana T. Freitas. Efficient alignment of pyrosequencing reads for re-sequencing applications. BMC Bioinformatics, 12:163, 2011. [ bib ]
[10]	Luís S. Russo, Gonzalo Navarro, and Arlindo L. Oliveira. Fully-compressed suffix trees. ACM Transactions on Algorithms (TALG), 7(4):article 53, 2011. 35 pages. [ bib ]
[11]	Gonzalo Navarro and Luís M. S. Russo. Space-efficient data-analysis queries on grids. Submitted to Theoretical Computer Science, 2011. [ bib ]
[12]	Gonzalo Navarro and Luís M. S. Russo. Space-efficient data-analysis queries on grids. In 22nd International Symposium on Algorithms and Computation, ISAAC, volume 7074 of Lecture Notes in Computer Science, pages 323-332. Springer, 2011. [ bib ]
[13]	German Tischler and Luís M. S. Russo. Succinct gapped suffix arrays. In Proc. 18th International Symposium on String Processing and Information Retrieval (SPIRE), LNCS. Springer, 2011. [ bib \| .html \| .ps \| .pdf ]
[14]	Jorge Costa, Gabriel Pereira Lopes, Luís Gomes, and Luís M. S. Russo. Managing and querying a bilingual lexicon with suffix trees. In Proceedings of the 15th Portuguese Conference on Artificial Intelligence (EPIA), Lecture Notes in Computer Science. Springer, 2011. [ bib \| .ps \| .pdf ]
[15]	Jorge Costa, Gabriel Pereira Lopes, Luís Gomes, and Luís M. S. Russo. Representing a bilingual lexicon with suffix trees. In Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21 - 24, 2011, pages 1164-1165. ACM, 2011. [ bib \| .ps \| .pdf ]
[16]	Francisco Fernandes, Paulo G. S. Fonseca, Luís M. S. Russo, Arlindo L. Oliveira, and Ana T. Freitas. Tapyr - an efficient high-throughput sequence aligner for re-sequencing applications. Brussels, Belgium. Poster at SeqAhead Scientific Meeting - BMBS COST Action BM1006, 2011. Poster. [ bib ]
[17]	Francisco Fernandes, Paulo G. S. Fonseca, Luís M. S. Russo, Arlindo L. Oliveira, and Ana T. Freitas. Tapyr - an efficient high-throughput sequence aligner for re-sequencing applications. Florianopolis, Brazil. Poster at X-Meeting 2011, 2011. Poster. [ bib ]
[18]	Luís M. S. Russo. Multiplication algorithms for monge matrices. In Proc. 17th International Symposium on String Processing and Information Retrieval (SPIRE), LNCS. Springer, 2010. [ bib \| .html \| .ps \| .pdf ]
[19]	Luís M. S. Russo, Gonzalo Navarro, and Arlindo L. Oliveira. Parallel and distributed compressed indexes. In Proc. 21st Annual Symposium on Combinatorial Pattern Matching (CPM), LNCS, pages 348-360. Springer, 2010. [ bib \| .html \| .ps \| .pdf ]
[20]	Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira, and Pedro Morales. Approximate string matching with compressed indexes. Algorithms, 2(3):1105-1136, 2009. [ bib \| DOI \| DOI \| http \| http \| .ps \| .pdf ]
[21]	Luís M. S. Russo and Arlindo L. Oliveira. A compressed self-index using a Ziv-Lempel dictionary. Journal of Information Retrieval, 2008. Special issue SPIRE 2006. [ bib \| DOI \| DOI \| .html \| .ps \| .pdf ]
[22]	Luís M. S. Russo, Gonzalo Navarro, and Arlindo L. Oliveira. Indexed hierarchical approximate string matching. In Proc. 15th International Symposium on String Processing and Information Retrieval (SPIRE), LNCS. Springer, 2008. [ bib \| .html \| .ps \| .pdf ]
[23]	Luís M. S. Russo, Gonzalo Navarro, and Arlindo L. Oliveira. Dynamic Fully-Compressed Suffix Trees. In Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching (CPM 2008), LNCS, 2008. [ bib \| .html \| .ps \| .pdf ]
[24]	Gonzalo Navarro and Luís M. S. Russo. Re-pair achieves high-order entropy. In Proc. 18th IEEE Data Compression Conference (DCC'08), page 537, 2008. Poster. [ bib \| A0 poster (.pdf) \| .html \| .ps \| .pdf ]
[25]	Luís M. S. Russo, Gonzalo Navarro, and Arlindo L. Oliveira. Fully-Compressed Suffix Trees. In Proc. 8th Latin American Symposium on Theoretical Informatics (LATIN), LNCS 4957, pages 362-373, 2008. [ bib \| DOI \| DOI \| .html \| .ps \| .pdf ]
[26]	Luís M. S. Russo and Arlindo L. Oliveira. Efficient generation of super condensed neighborhoods. Journal of Discrete Algorithms, 5(3):501-513, September 2007. [ bib \| DOI \| DOI \| .html \| .ps \| .pdf ]
[27]	Luís M. S. Russo. Enhanced Full-Text Self-Indexes based on Lempel-Ziv Compression. PhD thesis, Instituto Superior Técnico, 2007. Orientado por Arlindo Oliveira. [ bib \| .html \| .ps \| .pdf ]
[28]	Luís M. S. Russo, Gonzalo Navarro, and Arlindo L. Oliveira. Approximate string matching with Lempel-Ziv compressed indexes. In Nivio Ziviani and Ricardo A. Baeza-Yates, editors, SPIRE, volume 4726 of Lecture Notes in Computer Science, pages 264-275. Springer, 2007. [ bib \| DOI \| DOI \| .html \| .ps \| .pdf ]
[29]	Luís M. S. Russo and Arlindo L. Oliveira. A compressed self-index using a Ziv-Lempel dictionary. Technical Report 6/2006, INESC-ID, March 2006. [ bib ]
[30]	Luís M. S. Russo and Arlindo L. Oliveira. A compressed self-index using a Ziv-Lempel dictionary. In Fabio Crestani, Paolo Ferragina, and Mark Sanderson, editors, SPIRE, volume 4209 of Lecture Notes in Computer Science, pages 163-180. Springer, 2006. [ bib \| DOI \| DOI \| .html \| .ps \| .pdf ]
[31]	Luís M. S. Russo and Arlindo L. Oliveira. Faster generation of super condensed neighbourhoods using finite automata. In Mariano P. Consens and Gonzalo Navarro, editors, SPIRE, volume 3772 of Lecture Notes in Computer Science, pages 246-255. Springer, 2005. [ bib \| DOI \| DOI \| .html \| .ps \| .pdf ]
[32]	Luís M. S. Russo and Arlindo L. Oliveira. An efficient algorithm for generating super condensed neighborhoods. In Alberto Apostolico, Maxime Crochemore, and Kunsoo Park, editors, CPM, volume 3537 of LNCS, pages 104-115. Springer, 2005. [ bib \| DOI \| DOI \| .html \| .ps \| .pdf ]
[33]	Luís S. Russo. Algebra in a topos. Diploma thesis, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2003. Orientado por Pedro Resende. [ bib ]
[34]	Luís M. S. Russo. O teorema de Pitágoras. In J. P. Boavida, A. Cannas da Silva, Cruz-Filipe, Fachada L., J., and P. Resende, editors, Seminário Diagonal, IST 2000-01, pages 77-84. Proceedings IST, 1049-001 Lisboa, Portugal, 2001. [ bib \| .html \| .pdf ]
[35]	Costa, Ana Teresa Freitas, and Luís M. S. Russo. Exploring efficient data structures and algorithms for mapping rna-seq reads. In Proceedings of InForum 2011. Universidade de Coimbra, 09 2011. [ bib ]

This file was generated by bibtex2html 1.96.