Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

François-Joseph Lapointe

dblp:70/1801 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Computer graphics and multimedia
1 paper
Computer animation and physical simulation · 100%
Human-computer interaction and pervasive computing
1 paper
Games and playful interaction · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer animation and physical simulation › motion synthesis
choreography generation
0.112005
The dancing genome project: generation of a human-computer choreography using a genetic algorithm · ACM Multimedia 2005
Bioinformatics and computational biology
phylogenetics
0.012004
A weighted least-squares approach for inferring phylogenies from incomplete distance matrices · Bioinform. 2004
Bioinformatics and computational biology › phylogenetics
phylogenetic inference
0.012004
A weighted least-squares approach for inferring phylogenies from incomplete distance matrices · Bioinform. 2004
Games and playful interaction
interactive art
0.012005
The dancing genome project: generation of a human-computer choreography using a genetic algorithm · ACM Multimedia 2005

Methods — techniques the papers use, named apart from their topics

motion capture · 0.1genetic algorithm · 0.1weighted least squares · 0.0ultrametric inequality · 0.0four-point condition · 0.0
YearPublicationVenuePosition
2017 Using the stability of objects to determine the number of clusters in datasets
Etienne Lord, Matthieu Willems, François-Joseph Lapointe, Vladimir Makarenkov
Inf. Sci.3
2005 The dancing genome project: generation of a human-computer choreography using a genetic algorithm
abstract
In this paper, we present an interactive genetic algorithm for the generation of human-computer choreography, using motion capture technology. First, we introduce the four steps of the algorithm to (1) define a movement vocabulary, (2) initialize movement sequences, (3) generate mutants, and (4) select mutant sequences to create a choreography. Then, we show how this approach is implemented in real time to create interaction among dancers. Finally, we run simulations to assess the convergence rate of the algorithm, before generating a simple duet for actual and virtual dancers.
François-Joseph Lapointe, Martine Époque
ACM Multimedia1
2004 A weighted least-squares approach for inferring phylogenies from incomplete distance matrices
abstract
MOTIVATION: The problem of phylogenetic inference from datasets including incomplete or uncertain entries is among the most relevant issues in systematic biology. In this paper, we propose a new method for reconstructing phylogenetic trees from partial distance matrices. The new method combines the usage of the four-point condition and the ultrametric inequality with a weighted least-squares approximation to solve the problem of missing entries. It can be applied to infer phylogenies from evolutionary data including some missing or uncertain information, for instance, when observed nucleotide or protein sequences contain gaps or missing entries. RESULTS: In a number of simulations involving incomplete datasets, the proposed method outperformed the well-known Ultrametric and Additive procedures. Generally, the new method also outperformed all the other competing approaches including Triangle and Fitch which is the most popular least-squares method for reconstructing phylogenies. We illustrate the usefulness of the introduced method by analyzing two well-known phylogenies derived from complete mammalian mtDNA sequences. Some interesting theoretical results concerning the NP-hardness of the ordinary and weighted least-squares fitting of a phylogenetic tree to a partial distance matrix are also established. AVAILABILITY: The T-Rex package including this method is freely available for download at http://www.info.uqam.ca/~makarenv/trex.html
Vladimir Makarenkov, François-Joseph Lapointe
Bioinform.2