default search action
Fabio Pardi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]Nikolai Romashchenko
, Benjamin Linard
EPIK: precise and scalable evolutionary placement with informative k-mers. Bioinform. 39(12) (2023) - [j13]Nikolai Romashchenko
Computing Phylo-$k$k-Mers. IEEE ACM Trans. Comput. Biol. Bioinform. 20(5): 2889-2897 (2023) - 2021
- [j12]Benjamin Linard
PEWO: a collection of workflows to benchmark phylogenetic placement. Bioinform. 36(21): 5264-5266 (2021) - [j11]Guillaume E. Scholz, Benjamin Linard
Rapid screening and detection of inter-type viral recombinants using phylo-k-mers. Bioinform. 36(22-23): 5351-5360 (2021) - [j10]Nicola De Maio
A phylogenetic approach for weighting genetic sequences. BMC Bioinform. 22(1): 285 (2021) - [j9]Charles-Elie Rabier, Vincent Berry
On the inference of complex phylogenetic networks by Markov Chain Monte-Carlo. PLoS Comput. Biol. 17(9) (2021) - 2020
- [i4]Jakub Truszkowski, Céline Scornavacca, Fabio Pardi:
Computing the probability of gene trees concordant with the species tree in the multispecies coalescent. CoRR abs/2001.06741 (2020)
2010 – 2019
- 2019
- [j8]Benjamin Linard
Rapid alignment-free phylogenetic identification of metagenomic sequences. Bioinform. 35(18): 3303-3312 (2019) - [i3]Mark Jones, Philippe Gambette, Leo van Iersel, Remie Janssen, Steven Kelk, Fabio Pardi, Céline Scornavacca:
Cutting an alignment with Ockham's razor. CoRR abs/1910.11041 (2019) - 2017
- [j7]Philippe Gambette
Rearrangement moves on rooted phylogenetic networks. PLoS Comput. Biol. 13(8) (2017) - [i2]Steven Kelk, Fabio Pardi, Céline Scornavacca, Leo van Iersel:
Finding the most parsimonious or likely tree in a network with respect to an alignment. CoRR abs/1707.03648 (2017) - 2016
- [j6]Manuel Binet, Olivier Gascuel, Céline Scornavacca, Emmanuel J. P. Douzery, Fabio Pardi:
Fast and accurate branch lengths estimation for phylogenomic trees. BMC Bioinform. 17: 23 (2016) - [r1]Olivier Gascuel, Fabio Pardi, Jakub Truszkowski
Distance-Based Phylogeny Reconstruction: Safety and Edge Radius. Encyclopedia of Algorithms 2016: 567-571 - [i1]Philippe Gambette, Leo van Iersel, Steven Kelk, Fabio Pardi, Céline Scornavacca:
Do branch lengths help to locate a tree in a phylogenetic network? CoRR abs/1607.06285 (2016) - 2015
- [j5]Fabio Pardi, Céline Scornavacca:
Reconstructible Phylogenetic Networks: Do Not Distinguish the Indistinguishable. PLoS Comput. Biol. 11(4) (2015) - 2010
- [j4]Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport:
Approximate Maximum Parsimony and Ancestral Maximum Likelihood. IEEE ACM Trans. Comput. Biol. Bioinform. 7(1): 183-187 (2010)
2000 – 2009
- 2009
- [j3]Bui Quang Minh
Budgeted Phylogenetic Diversity on Circular Split Systems. IEEE ACM Trans. Comput. Biol. Bioinform. 6(1): 22-29 (2009) - 2008
- [j2]Michael L. Tress
Determination and validation of principal gene products. Bioinform. 24(1): 11-17 (2008) - 2005
- [j1]Fabio Pardi, Douglas F. Levinson, Cathryn M. Lewis
GSMA: software implementation of the genome search meta-analysis method. Bioinform. 21(24): 4430-4431 (2005) - 2002
- [c1]Fabio Pardi:
Category Similarity as a Predictor for SVM Learning Performance. FLAIRS 2002: 173-177
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-08-05 20:25 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: