activity
20132020
most citedWell-supported phylogenies using largest subsets of core-genes by discrete particle swarm optimization

5 citations · 10 across the 6 of their papers we have counts for

collaborators

6 papers

cs.AI2020★ 2 cited

Multi-agent model for risk prediction in surgery

Bruno Perez, Julien Henriet, Christophe Lang +1

Risk management resulting from the actions and states of the different elements making up a operating room is a major concern during a surgical procedure. Agent-based simulation sh…

cs.DB2019

Safe Disassociation of Set-Valued Datasets

Nancy Awad, Bechara Al Bouna, Jean-Francois Couchot +1

Disassociation introduced by Terrovitis et al. is a bucketization based anonimyzation technique that divides a set-valued dataset into several clusters to hide the link between ind…

q-bio.PE2017★ 5 cited

Well-supported phylogenies using largest subsets of core-genes by discrete particle swarm optimization

Reem Alsrraj, Bassam AlKindy, Christophe Guyeux +2

The number of complete chloroplastic genomes increases day after day, making it possible to rethink plants phylogeny at the biomolecular era. Given a set of close plants sharing in…

cs.AI2016

Binary Particle Swarm Optimization versus Hybrid Genetic Algorithm for Inferring Well Supported Phylogenetic Trees

Bassam AlKindy, Bashar Al-Nuaimi, Christophe Guyeux +4

The amount of completely sequenced chloroplast genomes increases rapidly every day, leading to the possibility to build large-scale phylogenetic trees of plant species. Considering…

q-bio.BM2013

Computational investigations of folded self-avoiding walks related to protein folding

Jacques M. Bahi, Christophe Guyeux, Kamel Mazouzi +1

Various subsets of self-avoiding walks naturally appear when investigating existing methods designed to predict the 3D conformation of a protein of interest. Two such subsets, name…

q-bio.BM2013★ 3 cited

Protein structure prediction software generate two different sets of conformations. Or the study of unfolded self-avoiding walks

Jacques M. Bahi, Christophe Guyeux, Jean-Marc Nicod +1

Self-avoiding walks (SAW) are the source of very difficult problems in probabilities and enumerative combinatorics. They are also of great interest as they are, for instance, the b…