Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGustavo Sacomoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j8]Vicente Acuña, Roberto Grossi, Giuseppe Francesco Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri
:
On Bubble Generators in Directed Graphs. Algorithmica 82(4): 898-914 (2020)
2010 – 2019
- 2018
- [j7]Katerina Böhmová, Luca Häfliger, Matús Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot:
Computing and Listing st-Paths in Public Transportation Networks. Theory Comput. Syst. 62(3): 600-621 (2018) - 2017
- [j6]Leandro Lima, Blerina Sinaimeri, Gustavo Sacomoto, Hélène Lopez-Maestre, Camille Marchet, Vincent Miele, Marie-France Sagot, Vincent Lacroix:
Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads. Algorithms Mol. Biol. 12(1): 2:1-2:19 (2017) - [c11]Vicente Acuña, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri:
On Bubble Generators in Directed Graphs. WG 2017: 18-31 - 2016
- [c10]Bastien Cazaux, Gustavo Sacomoto, Eric Rivals:
Superstring Graph: A New Approach for Genome Assembly. AAIM 2016: 39-52 - [c9]Katerina Böhmová, Matús Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot:
Computing and Listing st-Paths in Public Transportation Networks. CSR 2016: 102-116 - 2015
- [j5]Gustavo Sacomoto, Vincent Lacroix, Marie-France Sagot:
A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs. Algorithms Mol. Biol. 10: 20 (2015) - [j4]Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri:
Computing an Evolutionary Ordering is Hard. Electron. Notes Discret. Math. 50: 255-260 (2015) - 2014
- [j3]Kamil Salikhov, Gustavo Sacomoto, Gregory Kucherov:
Using cascading Bloom filters to improve the memory usage for de Brujin graphs. Algorithms Mol. Biol. 9: 2 (2014) - [c8]Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot:
Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. ESA 2014: 418-429 - [c7]Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot:
Efficiently Listing Bounded Length st-Paths. IWOCA 2014: 318-329 - [c6]Gustavo Sacomoto, Blerina Sinaimeri, Camille Marchet, Vincent Miele, Marie-France Sagot, Vincent Lacroix:
Navigating in a Sea of Repeats in RNA-seq without Drowning. WABI 2014: 82-96 - [i7]Gustavo Sacomoto, Blerina Sinaimeri, Camille Marchet, Vincent Miele, Marie-France Sagot, Vincent Lacroix:
Navigating in a sea of repeats in RNA-seq without drowning. CoRR abs/1406.1022 (2014) - [i6]Gustavo Sacomoto:
Efficient Algorithms for de novo Assembly of Alternative Splicing Events from RNA-seq Data. CoRR abs/1406.6047 (2014) - [i5]Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot:
Amortized Õ(|V|)-Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. CoRR abs/1408.1265 (2014) - [i4]Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri:
Computing an Evolutionary Ordering is Hard. CoRR abs/1410.6663 (2014) - [i3]Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot:
Efficiently listing bounded length st-paths. CoRR abs/1411.6852 (2014) - 2013
- [c5]Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto:
Optimal Listing of Cycles and st-Paths in Undirected Graphs. SODA 2013: 1884-1896 - [c4]Gustavo Sacomoto, Vincent Lacroix, Marie-France Sagot:
A Polynomial Delay Algorithm for the Enumeration of Bubbles with Length Constraints in Directed Graphs and Its Application to the Detection of Alternative Splicing in RNA-seq Data. WABI 2013: 99-111 - [c3]Kamil Salikhov, Gustavo Sacomoto, Gregory Kucherov:
Using Cascading Bloom Filters to Improve the Memory Usage for de Brujin Graphs. WABI 2013: 364-376 - [i2]Gustavo Sacomoto, Vincent Lacroix, Marie-France Sagot:
A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs and its application to the detection of alternative splicing in RNA-seq data. CoRR abs/1307.7813 (2013) - 2012
- [j2]Gustavo Akio Tominaga Sacomoto, Janice Kielbassa, Rayan Chikhi, Raluca Uricaru, Pavlos Antoniou, Marie-France Sagot, Pierre Peterlongo, Vincent Lacroix:
KISSPLICE: de-novo calling alternative splicing events from RNA-seq data. BMC Bioinform. 13(S-6): S5 (2012) - [c2]Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot:
Efficient Bubble Enumeration in Directed Graphs. SPIRE 2012: 118-129 - [i1]Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot:
Optimal Listing of Cycles and st-Paths in Undirected Graphs. CoRR abs/1205.2766 (2012) - 2011
- [c1]Gustavo Akio Tominaga Sacomoto, Alair Pereira do Lago:
A New Algorithm for Sparse Suffix Trees. BSB 2011: 34-41
2000 – 2009
- 2009
- [j1]Pierre Peterlongo, Gustavo Akio Tominaga Sacomoto, Alair Pereira do Lago, Nadia Pisanti, Marie-France Sagot:
Lossless filter for multiple repeats with bounded edit distance. Algorithms Mol. Biol. 4 (2009)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 2023-02-13 22:11 CET 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:
