[1]	Luís M.S. and Russo. Monge properties of sequence alignment. Theoretical Computer Science, 423(0):30 - 49, 2012. [ bib \| DOI \| DOI \| http ]
[2]	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 ]
[3]	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 ]
[4]	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 ]
[5]	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 ]
[6]	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 ]
[7]	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 ]
[8]	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 ]

This file was generated by bibtex2html 1.96.