[1]	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 ]
[2]	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 ]
[3]	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 ]
[4]	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 ]
[5]	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 ]
[6]	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 ]
[7]	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 ]
[8]	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 ]
[9]	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 ]
[10]	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 ]
[11]	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 ]
[12]	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 ]
[13]	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 ]
[14]	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 ]
[15]	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.