Guilherme P. Telles

Orcid: 0000-0003-2608-4807

According to our database1, Guilherme P. Telles authored at least 40 papers between 1998 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Weighted-Centroid localization using LoRaWAN network on large outdoor areas.
Internet Technol. Lett., 2022

Genome Comparison on Succinct Colored de Bruijn Graphs.
Proceedings of the String Processing and Information Retrieval, 2022

2020
Construction of Fundamental Data Structures for Strings
Springer Briefs in Computer Science, Springer, ISBN: 978-3-030-55107-0, 2020

Practical regular expression constrained sequence alignment.
Theor. Comput. Sci., 2020

gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections.
Algorithms Mol. Biol., 2020

Graphs from Features: Tree-Based Graph Layout for Feature Analysis.
Algorithms, 2020

2019
The Visual SuperTree: similarity-based multi-scale visualization.
Vis. Comput., 2019

Algorithms to compute the Burrows-Wheeler Similarity Distribution.
Theor. Comput. Sci., 2019

External memory BWT and LCP computation for sequence collections with applications.
Algorithms Mol. Biol., 2019

Inducing the Lyndon Array.
Proceedings of the String Processing and Information Retrieval, 2019

2018
Lyndon array construction during Burrows-Wheeler inversion.
J. Discrete Algorithms, 2018

Live neighbor-joining.
BMC Bioinform., 2018

A Genetic Algorithm for Character State Live Phylogeny.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2018

Computing Burrows-Wheeler Similarity Distributions for String Collections.
Proceedings of the String Processing and Information Retrieval, 2018

2017
Inducing enhanced suffix arrays for string collections.
Theor. Comput. Sci., 2017

Burrows-Wheeler transform and LCP array construction in constant space.
J. Discrete Algorithms, 2017

Optimal suffix sorting and LCP array construction for constant alphabets.
Inf. Process. Lett., 2017

CellNetVis: a web tool for visualization of biological networks using force-directed layout constrained by cellular components.
BMC Bioinform., 2017

Generalized enhanced suffix array construction in external memory.
Algorithms Mol. Biol., 2017

A Heuristic for the Live Parsimony Problem.
Proceedings of the Biomedical Engineering Systems and Technologies, 2017

A Branch and Bound for the Large Live Parsimony Problem.
Proceedings of the 10th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2017), 2017

Distance-based Live Phylogeny.
Proceedings of the 10th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2017), 2017

2016
An improved algorithm for the all-pairs suffix-prefix problem.
J. Discrete Algorithms, 2016

Parallel Computation for the All-Pairs Suffix-Prefix Problem.
Proceedings of the String Processing and Information Retrieval, 2016

Induced Suffix Sorting for String Collections.
Proceedings of the 2016 Data Compression Conference, 2016

2015
InteractiVenn: a web-based tool for the analysis of sets through Venn diagrams.
BMC Bioinform., 2015

Computing the BWT and the LCP Array in Constant Space.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2013
Live Phylogeny.
J. Comput. Biol., 2013

External Memory Generalized Suffix and LCP Arrays Construction.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012
Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design.
IEEE Trans. Evol. Comput., 2012

Semantic Wordification of Document Collections.
Comput. Graph. Forum, 2012

2011
Improved Similarity Trees and their Application to Visual Data Classification.
IEEE Trans. Vis. Comput. Graph., 2011

kGC: Finding Groups of Homologous Genes across Multiple Genomes.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2011

2007
Normalized compression distance for visual analysis of document collections.
Comput. Graph., 2007

A Method for Inferring Biological Functions Using Homologous Genes Among Three Genomes.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2007

Point Placement by Phylogenetic Trees and its Application to Visual Analysis of Document Collections.
Proceedings of the 2nd IEEE Symposium on Visual Analytics Science and Technology, 2007

2005
Building PQR trees in almost-linear time.
Electron. Notes Discret. Math., 2005

A Method for Comparing Three Genomes.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2005

2003
Um algoritmo quase-linear para arvores PQR e um esquema para clustering de sequencias expressas de cana-de-açucar.
PhD thesis, 2003

1998
On the Consecutive Ones Property.
Discret. Appl. Math., 1998


  Loading...