Optimal Discretization Orders for Distance Geometry: a Theoretical Standpoint

Antonio Mucherino 1
1 GenScale - Scalable, Optimized and Parallel Algorithms for Genomics
Inria Rennes – Bretagne Atlantique , IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
Abstract : Distance geometry consists in embedding a simple weighted undirected graph G=(V,E,d) in a K-dimensional space so that all distances d(u,v), which are the weights on the edges of G, are satisfied by the positions assigned to its vertices. The search domain of this problem is generally continuous, but it can be discretized under certain assumptions, that are strongly related to the order given to the vertices of G. This paper formalizes the concept of optimal partial discretization order, and adapts a previously proposed algorithm with the aim of finding discretization orders that are also able to optimize a given set of objectives. The objectives are conceived for improving the structure of the discrete search domain, for its exploration to become more efficient.
Type de document :
Communication dans un congrès
LSSC2015 - Proceedings of Large Scale Scientific Computations, Jun 2015, Sozopol, Bulgaria. 2015, Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/hal-01196701
Contributeur : Antonio Mucherino <>
Soumis le : jeudi 10 septembre 2015 - 11:53:48
Dernière modification le : mardi 16 janvier 2018 - 15:54:20

Identifiants

  • HAL Id : hal-01196701, version 1

Citation

Antonio Mucherino. Optimal Discretization Orders for Distance Geometry: a Theoretical Standpoint. LSSC2015 - Proceedings of Large Scale Scientific Computations, Jun 2015, Sozopol, Bulgaria. 2015, Lecture Notes in Computer Science. 〈hal-01196701〉

Partager

Métriques

Consultations de la notice

261