Luís M. S. Russo

According to our database1, Luís M. S. Russo authored at least 36 papers between 2005 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Cartesian and Lyndon trees.
Theor. Comput. Sci., 2020

2019
A study on splay trees.
Theor. Comput. Sci., 2019

Flying tourist problem: Flight time and cost minimization in complex routes.
Expert Syst. Appl., 2019

On dynamic succinct graph representations.
CoRR, 2019

Order-Preserving Pattern Matching Indeterminate Strings.
CoRR, 2019

2018
Linking and Cutting Spanning Trees.
Algorithms, 2018

Order-Preserving Pattern Matching Indeterminate Strings.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017
Cartesian trees and Lyndon trees.
CoRR, 2017

2016
Compressed Suffix Trees.
Encyclopedia of Algorithms, 2016

Extending quick hypervolume.
J. Heuristics, 2016

2015
Improving Bilingual Search Performance Using Compact Full-Text Indices.
Proceedings of the Computational Linguistics and Intelligent Text Processing, 2015

2014
Quick Hypervolume.
IEEE Trans. Evolutionary Computation, 2014

Data Management in Metagenomics: A Risk Management Approach.
IJDC, 2014

Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER.
BMC Bioinformatics, 2014

Fast Fully-Compressed Suffix Trees.
Proceedings of the Data Compression Conference, 2014

2013
Space-efficient data-analysis queries on grids.
Theor. Comput. Sci., 2013

Parallel efficient aligner of pyrosequencing reads.
Proceedings of the 20th European MPI Users's Group Meeting, 2013

Compact and Fast Indexes for Translation Related Tasks.
Proceedings of the Progress in Artificial Intelligence, 2013

2012
Monge properties of sequence alignment.
Theor. Comput. Sci., 2012

Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis.
Algorithms for Molecular Biology, 2012

2011
Fully compressed suffix trees.
ACM Trans. Algorithms, 2011

Efficient alignment of pyrosequencing reads for re-sequencing applications.
BMC Bioinformatics, 2011

Succinct Gapped Suffix Arrays.
Proceedings of the String Processing and Information Retrieval, 2011

Representing a bilingual lexicon with suffix trees.
Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011

Space-Efficient Data-Analysis Queries on Grids.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Multiplication Algorithms for Monge Matrices.
Proceedings of the String Processing and Information Retrieval, 2010

Parallel and Distributed Compressed Indexes.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009
Approximate String Matching with Compressed Indexes.
Algorithms, 2009

2008
A compressed self-index using a Ziv-Lempel dictionary.
Inf. Retr., 2008

Indexed Hierarchical Approximate String Matching.
Proceedings of the String Processing and Information Retrieval, 2008

Re-pair Achieves High-Order Entropy.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Dynamic Fully-Compressed Suffix Trees.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007
Efficient generation of super condensed neighborhoods.
J. Discrete Algorithms, 2007

Approximate String Matching with Lempel-Ziv Compressed Indexes.
Proceedings of the String Processing and Information Retrieval, 2007

2005
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata.
Proceedings of the String Processing and Information Retrieval, 2005

An Efficient Algorithm for Generating Super Condensed Neighborhoods.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005


  Loading...