Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Luís M. S. Russo
2010 – today
- 2013
[j8]Gonzalo Navarro, Yakov Nekrich, Luís M. S. Russo: Space-efficient data-analysis queries on grids. Theor. Comput. Sci. 482: 60-72 (2013)- 2012
- [j7]Susana Vinga, Alexandra M. Carvalho, Alexandre P. Francisco, Luís M. S. Russo, Jonas S. Almeida: Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis. Algorithms for Molecular Biology 7: 10 (2012)
- [j6]
- [i2]
- 2011
- [j5]Francisco Fernandes, Paulo G. S. da Fonseca, Luís M. S. Russo, Arlindo L. Oliveira, Ana T. Freitas: Efficient alignment of pyrosequencing reads for re-sequencing applications. BMC Bioinformatics 12: 163 (2011)
- [j4]Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira: Fully compressed suffix trees. ACM Transactions on Algorithms 7(4): 53 (2011)
- [c13]Gonzalo Navarro, Luís M. S. Russo: Space-Efficient Data-Analysis Queries on Grids. ISAAC 2011: 323-332
- [c12]Jorge Costa, Gabriel Pereira Lopes, Luís Gomes, Luís M. S. Russo: Representing a bilingual lexicon with suffix trees. SAC 2011: 1164-1165
- [c11]
- [i1]Gonzalo Navarro, Luís M. S. Russo: Space-Efficient Data-Analysis Queries on Grids. CoRR abs/1106.4649 (2011)
- 2010
- [c10]Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira: Parallel and Distributed Compressed Indexes. CPM 2010: 348-360
- [c9]
2000 – 2009
- 2009
- [j3]Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira, Pedro Morales: Approximate String Matching with Compressed Indexes. Algorithms 2(3): 1105-1136 (2009)
- 2008
- [j2]Luís M. S. Russo, Arlindo L. Oliveira: A compressed self-index using a Ziv-Lempel dictionary. Inf. Retr. 11(4): 359-388 (2008)
- [c8]Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira: Dynamic Fully-Compressed Suffix Trees. CPM 2008: 191-203
- [c7]
- [c6]Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira: Fully-Compressed Suffix Trees. LATIN 2008: 362-373
- [c5]Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira: Indexed Hierarchical Approximate String Matching. SPIRE 2008: 144-154
- 2007
- [j1]Luís M. S. Russo, Arlindo L. Oliveira: Efficient generation of super condensed neighborhoods. J. Discrete Algorithms 5(3): 501-513 (2007)
- [c4]Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira: Approximate String Matching with Lempel-Ziv Compressed Indexes. SPIRE 2007: 264-275
- 2006
- [c3]Luís M. S. Russo, Arlindo L. Oliveira: A Compressed Self-index Using a Ziv-Lempel Dictionary. SPIRE 2006: 163-180
- 2005
- [c2]Luís M. S. Russo, Arlindo L. Oliveira: An Efficient Algorithm for Generating Super Condensed Neighborhoods. CPM 2005: 104-115
- [c1]Luís M. S. Russo, Arlindo L. Oliveira: Faster Generation of Super Condensed Neighbourhoods Using Finite Automata. SPIRE 2005: 246-255
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-19 20:45 CEST by the dblp team