default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuilherme P. Telles
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j23]Guilherme Pimentel Telles, Ohara Kerusauskas Rayel
, Guilherme Luiz Moritz:
Weighted-Centroid localization using LoRaWAN network on large outdoor areas. Internet Technol. Lett. 5(4) (2022)- [c16]Lucas P. Ramos, Felipe A. Louza, Guilherme P. Telles:
Genome Comparison on Succinct Colored de Bruijn Graphs. SPIRE 2022: 165-177 - 2020
- [b2]Felipe A. Louza, Simon Gog, Guilherme P. Telles:
Construction of Fundamental Data Structures for Strings. Springer Briefs in Computer Science, Springer 2020, ISBN 978-3-030-55107-0, pp. 3-101 - [j22]Rosane Minghim, Liz Huancapaza, Erasmo Artur, Guilherme P. Telles, Ivar Vargas Belizario:
Graphs from Features: Tree-Based Graph Layout for Feature Analysis. Algorithms 13(11): 302 (2020) - [j21]Felipe A. Louza, Guilherme P. Telles, Simon Gog, Nicola Prezza, Giovanna Rosone:
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections. Algorithms Mol. Biol. 15(1): 18 (2020) - [j20]Lise Rommel Romero Navarrete, Guilherme P. Telles:
Practical regular expression constrained sequence alignment. Theor. Comput. Sci. 815: 95-108 (2020)
2010 – 2019
- 2019
- [j19]Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles:
External memory BWT and LCP computation for sequence collections with applications. Algorithms Mol. Biol. 14(1): 6:1-6:15 (2019) - [j18]Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao:
Algorithms to compute the Burrows-Wheeler Similarity Distribution. Theor. Comput. Sci. 782: 145-156 (2019) - [j17]Renato R. O. da Silva, Jose Gustavo de Souza Paiva, Guilherme P. Telles, Carlos E. A. Zampieri, Fábio P. Rolli, Rosane Minghim:
The Visual SuperTree: similarity-based multi-scale visualization. Vis. Comput. 35(6-8): 1067-1080 (2019) - [c15]Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles:
Inducing the Lyndon Array. SPIRE 2019: 138-151 - [i5]Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao:
Algorithms to compute the Burrows-Wheeler Similarity Distribution. CoRR abs/1903.10583 (2019) - [i4]Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles:
Inducing the Lyndon Array. CoRR abs/1905.12987 (2019) - 2018
- [j16]Guilherme P. Telles, Graziela S. Araújo, Maria Emília Telles Walter, Marcelo M. Brigido, Nalvo F. Almeida:
Live neighbor-joining. BMC Bioinform. 19(1): 172:1-172:13 (2018) - [j15]Felipe A. Louza, William F. Smyth, Giovanni Manzini, Guilherme P. Telles:
Lyndon array construction during Burrows-Wheeler inversion. J. Discrete Algorithms 50: 2-9 (2018) - [c14]Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao:
Computing Burrows-Wheeler Similarity Distributions for String Collections. SPIRE 2018: 285-296 - [c13]Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles:
External memory BWT and LCP computation for sequence collections with applications. WABI 2018: 10:1-10:14 - [c12]Rafael L. Fernandes, Rogério Güths, Guilherme P. Telles, Nalvo F. Almeida, Maria Emília M. T. Walter:
A Genetic Algorithm for Character State Live Phylogeny. BSB 2018: 114-123 - [i3]Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles:
External memory BWT and LCP computation for sequence collections with applications. CoRR abs/1805.06821 (2018) - 2017
- [j14]Felipe A. Louza, Guilherme P. Telles, Steve Hoffmann, Cristina Dutra de Aguiar Ciferri:
Generalized enhanced suffix array construction in external memory. Algorithms Mol. Biol. 12(1): 26:1-26:16 (2017) - [j13]Henry Heberle, Marcelo Falsarella Carazzolle, Guilherme P. Telles, Gabriela Meirelles, Rosane Minghim:
CellNetVis: a web tool for visualization of biological networks using force-directed layout constrained by cellular components. BMC Bioinform. 18(S-10): 25-37 (2017) - [j12]Felipe A. Louza, Simon Gog, Guilherme P. Telles:
Optimal suffix sorting and LCP array construction for constant alphabets. Inf. Process. Lett. 118: 30-34 (2017) - [j11]Felipe A. Louza, Travis Gagie, Guilherme P. Telles:
Burrows-Wheeler transform and LCP array construction in constant space. J. Discrete Algorithms 42: 14-22 (2017) - [j10]Felipe A. Louza, Simon Gog, Guilherme P. Telles:
Inducing enhanced suffix arrays for string collections. Theor. Comput. Sci. 678: 22-39 (2017) - [c11]Rogério Güths, Guilherme P. Telles, Maria Emília M. T. Walter, Nalvo F. Almeida:
A Branch and Bound for the Large Live Parsimony Problem. BIOINFORMATICS 2017: 184-189 - [c10]Graziela S. Araújo, Guilherme P. Telles, Maria Emília M. T. Walter, Nalvo F. Almeida:
Distance-based Live Phylogeny. BIOINFORMATICS 2017: 196-201 - [c9]Rogério Güths, Guilherme P. Telles, Maria Emília M. T. Walter, Nalvo F. Almeida:
A Heuristic for the Live Parsimony Problem. BIOSTEC (Selected Papers) 2017: 248-267 - [i2]Felipe A. Louza, W. F. Smyth, Giovanni Manzini, Guilherme P. Telles:
Lyndon Array Construction during Burrows-Wheeler Inversion. CoRR abs/1710.10105 (2017) - 2016
- [j9]William H. A. Tustumi, Simon Gog, Guilherme P. Telles, Felipe A. Louza:
An improved algorithm for the all-pairs suffix-prefix problem. J. Discrete Algorithms 37: 34-43 (2016) - [c8]Felipe A. Louza, Simon Gog, Guilherme P. Telles:
Induced Suffix Sorting for String Collections. DCC 2016: 43-52 - [c7]Felipe A. Louza, Simon Gog, Leandro Zanotto, Guido Araujo, Guilherme P. Telles:
Parallel Computation for the All-Pairs Suffix-Prefix Problem. SPIRE 2016: 122-132 - [i1]Felipe A. Louza, Travis Gagie, Guilherme P. Telles:
Burrows-Wheeler transform and LCP array construction in constant space. CoRR abs/1611.08198 (2016) - 2015
- [j8]Henry Heberle, Gabriela Meirelles, Felipe R. da Silva, Guilherme P. Telles, Rosane Minghim:
InteractiVenn: a web-based tool for the analysis of sets through Venn diagrams. BMC Bioinform. 16: 169:1-169:7 (2015) - [c6]Felipe A. Louza, Guilherme P. Telles:
Computing the BWT and the LCP Array in Constant Space. IWOCA 2015: 312-320 - 2013
- [j7]Guilherme P. Telles, Nalvo F. Almeida, Rosane Minghim, Maria Emília M. T. Walter:
Live Phylogeny. J. Comput. Biol. 20(1): 30-37 (2013) - [c5]Felipe A. Louza, Guilherme P. Telles, Cristina Dutra de Aguiar Ciferri:
External Memory Generalized Suffix and LCP Arrays Construction. CPM 2013: 201-210 - 2012
- [j6]Fernando Vieira Paulovich, Franklina Maria Bragion Toledo, Guilherme P. Telles, Rosane Minghim, Luis Gustavo Nonato:
Semantic Wordification of Document Collections. Comput. Graph. Forum 31(3pt3): 1145-1153 (2012) - [j5]Alexandre C. B. Delbem, Telma Woerle de Lima, Guilherme P. Telles:
Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design. IEEE Trans. Evol. Comput. 16(6): 829-846 (2012) - 2011
- [j4]Jose Gustavo Paiva, Laura Florian, Hélio Pedrini, Guilherme P. Telles, Rosane Minghim:
Improved Similarity Trees and their Application to Visual Data Classification. IEEE Trans. Vis. Comput. Graph. 17(12): 2459-2468 (2011) - [c4]Guilherme P. Telles, Nalvo F. Almeida, Marcelo M. Brigido, Paulo Antonio Alvarez, Maria Emília Telles Walter:
kGC: Finding Groups of Homologous Genes across Multiple Genomes. BSB 2011: 79-82 - [e2]Osmar Norberto de Souza, Guilherme P. Telles, Mathew J. Palakal:
Advances in Bioinformatics and Computational Biology - 6th Brazilian Symposium on Bioinformatics, BSB 2011, Brasilia, Brazil, August 10-12, 2011. Proceedings. Lecture Notes in Computer Science 6832, Springer 2011, ISBN 978-3-642-22824-7 [contents]
2000 – 2009
- 2007
- [j3]Guilherme P. Telles, Rosane Minghim, Fernando Vieira Paulovich:
Normalized compression distance for visual analysis of document collections. Comput. Graph. 31(3): 327-337 (2007) - [c3]Ana M. Cuadros, Fernando Vieira Paulovich, Rosane Minghim, Guilherme P. Telles:
Point Placement by Phylogenetic Trees and its Application to Visual Analysis of Document Collections. IEEE VAST 2007: 99-106 - [c2]Daniel A. S. Anjos, Gustavo G. Zerlotini, Guilherme A. Pinto, Maria Emília Telles Walter, Marcelo M. Brigido, Guilherme P. Telles, Carlos Juliano M. Viana, Nalvo F. Almeida:
A Method for Inferring Biological Functions Using Homologous Genes Among Three Genomes. BSB 2007: 69-80 - 2005
- [j2]Guilherme P. Telles, João Meidanis:
Building PQR trees in almost-linear time. Electron. Notes Discret. Math. 19: 33-39 (2005) - [c1]Guilherme P. Telles, Marcelo M. Brigido, Nalvo F. Almeida, Carlos Juliano M. Viana, Daniel A. S. Anjos, Maria Emília Telles Walter:
A Method for Comparing Three Genomes. BSB 2005: 160-169 - 2004
- [e1]Natália Florencio Martins, Maria Emília Telles Walter, Guilherme P. Telles, Marcelo M. Brigido:
III Brazilian Workshop on Bioinformatics, October 20-22, 2004, Brasília, Distrito Federal, Brazil. 2004 [contents] - 2003
- [b1]Guilherme Pimentel Telles:
Um algoritmo quase-linear para arvores PQR e um esquema para clustering de sequencias expressas de cana-de-açucar. University of Campinas, Brazil, 2003
1990 – 1999
- 1998
- [j1]Joao Meidanis, Oscar Porto, Guilherme P. Telles:
On the Consecutive Ones Property. Discret. Appl. Math. 88(1-3): 325-354 (1998)
Coauthor Index
aka: Maria Emília Telles Walter
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
