Vincent Ranwez
Orcid: 0000-0002-9308-7541
According to our database1,
Vincent Ranwez
authored at least 36 papers
between 1999 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2022
Post-hoc recommendation explanations through an efficient exploitation of the DBpedia category hierarchy.
Knowl. Based Syst., 2022
2021
Is diversity optimization always suitable? Toward a better understanding of diversity within recommendation approaches.
Inf. Process. Manag., 2021
2019
Apports des ontologies aux systèmes de recommandation : état de l'art et perspectives.
Proceedings of the IC 2019: 30es Journées francophones d'Ingénierie des Connaissances (Proceedings of the 30th French Knowledge Engineering Conference), 2019
2017
The genetic map comparator: a user-friendly application to display and compare genetic maps.
Bioinform., 2017
2016
2015
A fast method for calculating reliable event supports in tree reconciliations via Pareto optimality.
BMC Bioinform., 2015
BMC Bioinform., 2015
Proceedings of the Working Notes of CLEF 2015, 2015
2014
An information theoretic approach to improve semantic similarity assessments across multiple ontologies.
Inf. Sci., 2014
Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2014
Indexation conceptuelle par propagation. Application à un corpus d'articles scientifiques liés au cancer.
Proceedings of the CORIA 2014, 2014
2013
How Ontology Based Information Retrieval Systems May Benefit from Lexical Text Analysis.
Proceedings of the New Trends of Research in Ontologies and Lexical Resources, 2013
J. Bioinform. Comput. Biol., 2013
Disentangling homeologous contigs in allo-tetraploid assembly: application to durum wheat.
BMC Bioinform., 2013
Algorithms Mol. Biol., 2013
2012
Extraction de sous-ontologies autonomes par fermeture des opérateurs hyponymie et hyperonymie.
Tech. Sci. Informatiques, 2012
Subontology Extraction Using Hyponym and Hypernym Closure on is-a Directed Acyclic Graphs.
IEEE Trans. Knowl. Data Eng., 2012
BMC Bioinform., 2012
An O(n . m) algorithm for calculating the closure of lca-type operators.
Ars Comb., 2012
Accounting for Gene Tree Uncertainties Improves Gene Trees and Reconciliation Inference.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012
Proceedings of the CORIA (Conférence en Recherche d'Infomations et Applications), 2012
2011
Inf. Comput., 2011
Briefings Bioinform., 2011
2010
Proceedings of the Workshop on Semantic Web Applications and Tools for Life Sciences, 2010
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers.
Proceedings of the Comparative Genomics - International Workshop, 2010
Utilisation de proximités sémantiques pour améliorer la recherche et le rendu d'information.
Proceedings of the IC 2010 : 21es Journées Ingénierie des Connaissances 2010 (Proceedings of the 21st French Knowledge Engineering Conference), 2010
2009
Proceedings of the Language and Automata Theory and Applications, 2009
2008
BMC Bioinform., 2008
2006
Bio++: a set of C++ libraries for sequence analysis, phylogenetics, molecular evolution and population genetics.
BMC Bioinform., 2006
Proceedings of the On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops, 2006
2002
Méthodes efficaces pour reconstruire de grandes phylogénies suivant le principe du maximum de vraisemblance. (Efficient methods for reconstructing large phylogenies according to the maximum likelihood principle).
PhD thesis, 2002
Pattern Recognit. Lett., 2002
2000
Proceedings of the Computational Biology, 2000
1999
Proceedings of the Discrete Geometry for Computer Imagery, 1999