Skip to main content
Go to the home page of the European Commission (opens in new window)
English en
CORDIS - EU research results
CORDIS
Content archived on 2024-05-29

Geometric approximation algorithms and applications to bioinformatics

Objective

The goal of this project is twofold.

- First, we will design and analyse approximation algorithms for geometric problems. We will work on two types of problems: shortest paths problems in weighted (and possibly anisotropic) regions, and approximate Vorono i diagrams. Unlike previous work, our work on the weighted region problem will focus on removing the dependency on the bit-complexity of the input and, at the same time, remove the dependency on extra geometric parameters such as the measure of the smallest angle in the input triangulation. We will try to generalize approximate Voronoi diagrams to arbitrary convex distance functions, and we will try to obtain approximate Voronoi cells with a small number of facets.

- Second, we will apply techniques from computational geometry (and in particular, from geometric approximation algorithms) to bioinformatics problems. We want to combine existing expertise of INRA in bioinformatics and statistics with A. Vigneron's knowledge of geometric algorithms and data structures. We will work on ab-initio protein structure prediction, docking and 5D biological image analysis.

Fields of science (EuroSciVoc)

Keywords

Topic(s)

Call for proposal

FP6-2004-MOBILITY-12
See other projects for this call

Funding Scheme

IRG - Marie Curie actions-International re-integration grants

Coordinator

INSTITUT NATIONAL DE LA RECHERCHE AGRONOMIQUE
EU contribution
No data
Total cost
No data