Guilherme Pimentel Telles

Guilherme Pimentel Telles

Auto-generated profile, based on publicly available information

Guilherme Pimentel Telles

Institute of Computing, University of Campinas (UNICAMP), Campinas, Brazil

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 May 2015 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
HHHenry Heberle
Henry Heberle
GMGabriela Vaz Meirelles
Gabriela Vaz Meirelles
FSFelipe Rodrigues da Silva
Felipe Rodrigues da Silva
GTGuilherme P Telles
Guilherme P Telles
RMRosane Minghim
Rosane Minghim
Background: Set comparisons permeate a large number of data analysis workflows, in particular workflows in biological sciences. Venn diagrams are frequently employed for such analysis but current tools are limited. Results: We have developed InteractiVenn, a more flexible tool for interacting with Venn diagrams including up to six sets. It offers a clean interface for Venn diagram construction and enables analysis of set unions while preserving the shape of the diagram. Set unions are useful to reveal differences and similarities among sets and may be guided in our tool by a tree or by a list of set unions. The tool also allows obtaining subsets’ elements, saving and loading sets for further analyses, and exporting the diagram in vector and image formats. InteractiVenn has been used to analyze two biological datasets, but it may serve set analysis in a broad range of domains. Conclusions: InteractiVenn allows set unions in Venn diagrams to be explored thoroughly, by consequence extending the ability to analyze combinations of sets with additional observations, yielded by novel interactions between joined sets. InteractiVenn is freely available online at: www.interactivenn.net.

8 March 2019 in Algorithms for Molecular Biology
Verified
Journal Article
Open access
PDF file
LELavinia Egidi
Lavinia Egidi
FLFelipe Alves Louza
Felipe Alves Louza
GMGiovanni Manzini
Giovanni Manzini
GTGuilherme P. Telles
Guilherme P. Telles
Sequencing technologies produce larger and larger collections of biosequences that have to be stored in compressed indices supporting fast search operations. Many compressed indices are based on the Burrows–Wheeler Transform (BWT) and the longest common prefix (LCP) array. Because of the sheer size of the input it is important to build these data structures in external memory and time using in the best possible way the available RAM. We propose a space-efficient algorithm to compute the BWT and LCP array for a collection of sequences in the external or semi-external memory setting. Our algorithm splits the input collection into subcollections sufficiently small that it can compute their BWT in RAM using an optimal linear time algorithm. Next, it merges the partial BWTs in external or semi-external memory and in the process it also computes the LCP values. Our algorithm can be modified to output two additional arrays that, combined with the BWT and LCP array, provide simple, scan-based, external memory algorithms for three well known problems in bioinformatics: the computation of maximal repeats, the all pairs suffix–prefix overlaps, and the construction of succinct de Bruijn graphs. We prove that our algorithm performs $${\mathcal {O}}(n\, \mathsf {maxlcp})$$ sequential I/Os, where n is the total length of the collection and $$\mathsf {maxlcp}$$ is the maximum LCP value. The experimental results show that our algorithm is only slightly slower than the state of the art for short sequences but it is up to 40 times faster for longer sequences or when the available RAM is at least equal to the size of the input.

3 May 2024 in Analytical Chemistry
Verified
Journal Article
Open access
CBCristina F. Bazzano
Cristina F. Bazzano
RFRafael de Felicio
Rafael de Felicio
LALuiz Fernando Giolo Alves
Luiz Fernando Giolo Alves
JCJonas Costa
Jonas Costa
RORaquel Ortega
Raquel Ortega
DTDaniela Barretto Barbosa Trivella
Daniela Barretto Barbosa Trivella
Natural products (or specialized metabolites) are historically the main source of new drugs. However, the current drug discovery pipelines require miniaturization and speeds that are incompatible with traditional natural product research methods, especially in the early stages of the research. This article introduces the NP3 MS Workflow, a robust open-source software system for liquid chromatography-tandem mass spectrometry (LC-MS/MS) untargeted metabolomic data processing and analysis, designed to rank bioactive natural products directly from complex mixtures of compounds, such as bioactive biota samples. NP3 MS Workflow allows minimal user intervention as well as customization of each step of LC-MS/MS data processing, with diagnostic statistics to allow interpretation and optimization of LC-MS/MS data processing by the user. NP3 MS Workflow adds improved computing of the MS2 spectra in an LC-MS/MS data set and provides tools for automatic [M + H]+ ion deconvolution using fragmentation rules; chemical structural annotation against MS2 databases; and relative quantification of the precursor ions for bioactivity correlation scoring. The software will be presented with case studies and comparisons with equivalent tools currently available. NP3 MS Workflow shows a robust and useful approach to select bioactive natural products from complex mixtures, improving the set of tools available for untargeted metabolomics. It can be easily integrated into natural product-based drug-discovery pipelines and to other fields of research at the interface of chemistry and biology.

7 December 2017 in Algorithms for Molecular Biology
Verified
Journal Article
Open access
PDF file
FLFelipe Alves Louza
Felipe Alves Louza
GTGuilherme P. Telles
Guilherme P. Telles
SHSteve Hoffmann
Steve Hoffmann
CCCristina D. A. Ciferri
Cristina D. A. Ciferri
Suffix arrays, augmented by additional data structures, allow solving efficiently many string processing problems. The external memory construction of the generalized suffix array for a string collection is a fundamental task when the size of the input collection or the data structure exceeds the available internal memory. In this article we present and analyze $$\mathsf {eGSA}$$ [introduced in CPM (External memory generalized suffix and $$\mathsf {LCP}$$ arrays construction. In: Proceedings of CPM. pp 201–10, 2013)], the first external memory algorithm to construct generalized suffix arrays augmented with the longest common prefix array for a string collection. Our algorithm relies on a combination of buffers, induced sorting and a heap to avoid direct string comparisons. We performed experiments that covered different aspects of our algorithm, including running time, efficiency, external memory access, internal phases and the influence of different optimization strategies. On real datasets of size up to 24 GB and using 2 GB of internal memory, $$\mathsf {eGSA}$$ showed a competitive performance when compared to $$\mathsf {eSAIS}$$ and $$\mathsf {SAscan}$$ , which are efficient algorithms for a single string according to the related literature. We also show the effect of disk caching managed by the operating system on our algorithm. The proposed algorithm was validated through performance tests using real datasets from different domains, in various combinations, and showed a competitive performance. Our algorithm can also construct the generalized Burrows-Wheeler transform of a string collection with no additional cost except by the output time.

13 September 2017 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
HHHenry Heberle
Henry Heberle
MCMarcelo Falsarella Carazzolle
Marcelo Falsarella Carazzolle
GTGuilherme P. Telles
Guilherme P. Telles
GMGabriela Vaz Meirelles
Gabriela Vaz Meirelles
RMRosane Minghim
Rosane Minghim
The advent of “omics” science has brought new perspectives in contemporary biology through the high-throughput analyses of molecular interactions, providing new clues in protein/gene function and in the organization of biological pathways. Biomolecular interaction networks, or graphs, are simple abstract representations where the components of a cell (e.g. proteins, metabolites etc.) are represented by nodes and their interactions are represented by edges. An appropriate visualization of data is crucial for understanding such networks, since pathways are related to functions that occur in specific regions of the cell. The force-directed layout is an important and widely used technique to draw networks according to their topologies. Placing the networks into cellular compartments helps to quickly identify where network elements are located and, more specifically, concentrated. Currently, only a few tools provide the capability of visually organizing networks by cellular compartments. Most of them cannot handle large and dense networks. Even for small networks with hundreds of nodes the available tools are not able to reposition the network while the user is interacting, limiting the visual exploration capability. Here we propose CellNetVis, a web tool to easily display biological networks in a cell diagram employing a constrained force-directed layout algorithm. The tool is freely available and open-source. It was originally designed for networks generated by the Integrated Interactome System and can be used with networks from others databases, like InnateDB. CellNetVis has demonstrated to be applicable for dynamic investigation of complex networks over a consistent representation of a cell on the Web, with capabilities not matched elsewhere.

22 September 2020 in Algorithms for Molecular Biology
Verified
Journal Article
Open access
PDF file
FLFelipe Alves Louza
Felipe Alves Louza
GTGuilherme P. Telles
Guilherme P. Telles
SGSimon Gog
Simon Gog
Nicola PrezzaNicola Prezza
Nicola Prezza
GRGiovanna Rosone
Giovanna Rosone
Background: The construction of a suffix array for a collection of strings is a fundamental task in Bioinformatics and in many other applications that process strings. Related data structures, as the Longest Common Prefix array, the Burrows–Wheeler transform, and the document array, are often needed to accompany the suffix array to efficiently solve a wide variety of problems. While several algorithms have been proposed to construct the suffix array for a single string, less emphasis has been put on algorithms to construct suffix arrays for string collections. Result: In this paper we introduce , an open source software for constructing the suffix array and related data indexing structures for a string collection with N symbols in O(N) time. Our tool is written in and is based on the algorithm gSACA-K (Louza et al. in Theor Comput Sci 678:22–39, 2017), the fastest algorithm to construct suffix arrays for string collections. The tool supports large fasta, fastq and text files with multiple strings as input. Experiments have shown very good performance on different types of strings. Conclusions: is a fast, portable, and lightweight tool for constructing the suffix array and additional data structures for string collections.