Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFelipe A. Louza
Person information
- affiliation: Federal University of Uberlândia, Uberlândia, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c15]Frederico R. Rosa, Felipe A. Louza, Humberto Luiz Razente:
Vetor de sufixos métrico compacto. SBBD 2023: 414-419- [i13]Veronica Guerrini, Felipe A. Louza, Giovanna Rosone:
Lossy Compressor preserving variant calling through Extended BWT. CoRR abs/2304.08534 (2023) - 2022
- [j15]Lavinia Egidi, Felipe A. Louza
, Giovanni Manzini:
Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs. Algorithmica 84(3): 639-669 (2022) - [j14]Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro:
Grammar Compression by Induced Suffix Sorting. ACM J. Exp. Algorithmics 27: 1.1:1-1.1:33 (2022) - [c14]Veronica Guerrini, Felipe A. Louza, Giovanna Rosone:
Lossy Compressor Preserving Variant Calling through Extended BWT. BIOINFORMATICS 2022: 38-48 - [c13]Veronica Guerrini, Felipe A. Louza, Giovanna Rosone:
Parallel Lossy Compression for Large FASTQ Files. BIOSTEC (Selected Papers) 2022: 97-120 - [c12]Lucas P. Ramos, Felipe A. Louza, Guilherme P. Telles:
Genome Comparison on Succinct Colored de Bruijn Graphs. SPIRE 2022: 165-177 - 2021
- [j13]Felipe A. Louza, Neerja Mhaskar, W. F. Smyth:
A new approach to regular & indeterminate strings. Theor. Comput. Sci. 854: 105-115 (2021) - [i12]Marcelo K. Albertini, Felipe A. Louza:
Practical evaluation of Lyndon factors via alphabet reordering. CoRR abs/2108.04988 (2021) - 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 - [j12]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) - [j11]Veronica Guerrini, Felipe A. Louza, Giovanna Rosone:
Metagenomic analysis through the extended Burrows-Wheeler transform. BMC Bioinform. 21-S(8): 299 (2020) - [j10]Felipe A. Louza:
A simple algorithm for computing the document array. Inf. Process. Lett. 154 (2020) - [i11]Lavinia Egidi, Felipe A. Louza, Giovanni Manzini:
Space efficient merging of de Bruijn graphs and Wheeler graphs. CoRR abs/2009.03675 (2020) - [i10]Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro:
Grammar Compression By Induced Suffix Sorting. CoRR abs/2011.12898 (2020) - [i9]Felipe A. Louza, Neerja Mhaskar, W. F. Smyth:
A New Approach to Regular & Indeterminate Strings. CoRR abs/2012.07892 (2020)
2010 – 2019
- 2019
- [j9]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) - [j8]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) - [c11]Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles:
Inducing the Lyndon Array. SPIRE 2019: 138-151 - [c10]Lavinia Egidi, Felipe A. Louza, Giovanni Manzini:
Space-Efficient Merging of Succinct de Bruijn Graphs. SPIRE 2019: 337-351 - [i8]Lavinia Egidi, Felipe A. Louza, Giovanni Manzini:
Space-efficient merging of succinct de Bruijn graphs. CoRR abs/1902.02889 (2019) - [i7]Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao:
Algorithms to compute the Burrows-Wheeler Similarity Distribution. CoRR abs/1903.10583 (2019) - [i6]Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles:
Inducing the Lyndon Array. CoRR abs/1905.12987 (2019) - 2018
- [j7]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) - [c9]Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro:
A Grammar Compression Algorithm Based on Induced Suffix Sorting. DCC 2018: 42-51 - [c8]Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao:
Computing Burrows-Wheeler Similarity Distributions for String Collections. SPIRE 2018: 285-296 - [c7]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 - [i5]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) - [i4]Felipe A. Louza:
A Simple Algorithm for Computing the Document Array. CoRR abs/1812.09094 (2018) - 2017
- [b1]Felipe Alves da Louza:
Engineering augmented suffix sorting algorithms. University of Campinas, Brazil, 2017 - [j6]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) - [j5]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) - [j4]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) - [j3]Felipe A. Louza, Simon Gog, Guilherme P. Telles:
Inducing enhanced suffix arrays for string collections. Theor. Comput. Sci. 678: 22-39 (2017) - [i3]Felipe A. Louza, W. F. Smyth, Giovanni Manzini, Guilherme P. Telles:
Lyndon Array Construction during Burrows-Wheeler Inversion. CoRR abs/1710.10105 (2017) - [i2]Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro:
A Grammar Compression Algorithm based on Induced Suffix Sorting. CoRR abs/1711.03205 (2017) - 2016
- [j2]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) - [c6]Felipe A. Louza, Simon Gog, Guilherme P. Telles:
Induced Suffix Sorting for String Collections. DCC 2016: 43-52 - [c5]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
- [c4]Felipe A. Louza, Guilherme P. Telles:
Computing the BWT and the LCP Array in Constant Space. IWOCA 2015: 312-320 - 2013
- [c3]Felipe A. Louza, Guilherme P. Telles, Cristina Dutra de Aguiar Ciferri:
External Memory Generalized Suffix and LCP Arrays Construction. CPM 2013: 201-210 - 2012
- [j1]Daniel Yoshinobu Takada Chino, Felipe Alves Louza, Agma Juci Machado Traina, Cristina Dutra de Aguiar Ciferri, Caetano Traina Jr.:
Time Series Indexing Taking Advantage of the Generalized Suffix Tree. J. Inf. Data Manag. 3(2): 101-109 (2012) - 2011
- [c2]Daniel Yoshinobu Takada Chino, Felipe Alves Louza, Agma Juci Machado Traina, Cristina Dutra de Aguiar Ciferri, Caetano Traina Jr.:
Telesto: Indexação de Séries Temporais por Meio de Árvores de Sufixo Generalizadas. SBBD (Short Papers) 2011: 41-48 - [c1]Felipe Alves da Louza, Ricardo Rodrigues Ciferri, Cristina Dutra de Aguiar Ciferri:
Efficiently Querying Protein Sequences with the Proteinus Index. BSB 2011: 58-65
Coauthor Index
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:50 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:
