default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Tremblay Savard
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Kaari Landry
, Olivier Tremblay Savard, Manuel Lafond:
A Fixed-Parameter Tractable Algorithm for Finding Agreement Cherry-Reduced Subnetworks in Level-1 Orchard Networks. J. Comput. Biol. 31(4): 360-379 (2024)- [c8]Bertrand Marchand, Nadia Tahiri, Olivier Tremblay Savard, Manuel Lafond:
Finding Maximum Common Contractions Between Phylogenetic Networks. WABI 2024: 16:1-16:24 - [i2]Bertrand Marchand, Nadia Tahiri, Olivier Tremblay Savard, Manuel Lafond:
Finding Maximum Common Contractions Between Phylogenetic Networks. CoRR abs/2405.16713 (2024) - 2023
- [j5]Kaari Landry, Aivee Teodocio, Manuel Lafond, Olivier Tremblay Savard:
Defining Phylogenetic Network Distances Using Cherry Operations. IEEE ACM Trans. Comput. Biol. Bioinform. 20(3): 1654-1666 (2023) - [c7]Rogerio de Leon Pereira, Olivier Tremblay Savard:
Lessons Learned from Video Game Players Sorting Genomes. FDG 2023: 37:1-37:11 - [c6]Kaari Landry, Olivier Tremblay Savard, Manuel Lafond:
Finding Agreement Cherry-Reduced Subnetworks in Level-1 Networks. RECOMB-CG 2023: 179-195 - [i1]Kaari Landry, Olivier Tremblay Savard, Manuel Lafond:
Finding agreement cherry-reduced subnetworks in level-1 networks. CoRR abs/2305.00033 (2023) - 2021
- [j4]Meghan Chua, Anthony Tan, Olivier Tremblay Savard:
BOPAL 2.0 and a study of tRNA and rRNA gene evolution in Clostridium. J. Bioinform. Comput. Biol. 19(6): 2140007:1-2140007:24 (2021) - [c5]Kaari Landry, Aivee Teodocio, Manuel Lafond, Olivier Tremblay Savard:
Novel Phylogenetic Network Distances Based on Cherry Picking. AlCoB 2021: 57-81 - [c4]Rogerio de Leon Pereira, Anthony Tan, Andrea Bunt, Olivier Tremblay Savard:
Increasing player engagement, retention and performance through the inclusion of educational content in a citizen science game. FDG 2021: 16:1-16:12 - 2020
- [c3]Anjum Matin, Mardel Maduro, Rogerio de Leon Pereira, Olivier Tremblay Savard:
Effect of Timer, Top Score and Leaderboard on Performance and Motivation in a Human Computing Game. FDG 2020: 75:1-75:10
2010 – 2019
- 2016
- [c2]Olivier Tremblay Savard, Alexander Butyaev, Jérôme Waldispühl:
Collaborative Solving in a Human Computing Game Using a Market, Skills and Challenges. CHI PLAY 2016: 130-141 - 2012
- [j3]Olivier Tremblay Savard, Krister M. Swenson:
A graph-theoretic approach for inparalog detection. BMC Bioinform. 13(S-19): S16 (2012) - 2011
- [j2]Olivier Tremblay Savard, Denis Bertrand, Nadia El-Mabrouk:
Evolution of orthologous tandemly arrayed gene clusters. BMC Bioinform. 12(S-9): S2 (2011) - [j1]Olivier Tremblay Savard, Yves Gagnon, Denis Bertrand, Nadia El-Mabrouk:
Genome Halving and Double Distance with Losses. J. Comput. Biol. 18(9): 1185-1199 (2011) - 2010
- [c1]Yves Gagnon, Olivier Tremblay Savard, Denis Bertrand, Nadia El-Mabrouk:
Advances on Genome Duplication Distances. RECOMB-CG 2010: 25-38
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-10-07 21:22 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:
