Éditeur(s) : HAL CCSD Elsevier
Résumé : International audience
Given a graph, its hyperbolicity is a measure of how close its distance distribution is to the one of a tree. This parameter has gained recent attention in the analysis of some graph algorithms and the classification of complex networks. We study on practical improvements for the computation of hyperbolicity in large graphs. Precisely, we investigate on relations between the hyperbolicity of a graph G and the hyperbolicity of its atoms, that are the subgraphs output by the clique-decomposition invented by Tarjan [51, 65]. We prove that the maximum hyperbolicity taken over the atoms is at most one unit off from the hyperbol-icity of G and the bound is sharp. We also give an algorithm to slightly modify the atoms, called the " substitution method " , which is at no extra cost than computing the clique-decomposition, and so that the maximum hyperbolicity taken over the resulting graphs is exactly the hyperbolicity of the input graph G. An experimental evaluation of our method for computing the hyperbolicity of a given graph from its atoms is provided for collaboration networks and biological networks. Finally, on a more theoretical side, we deduce from our results the first linear-time algorithm for computing the hyperbolicity of an outerplanar graph.
ISSN: 0304-3975

hal-01540756
https://hal.inria.fr/hal-01540756
https://hal.inria.fr/hal-01540756/document
https://hal.inria.fr/hal-01540756/file/CCDL-2017.pdf
DOI : 10.1016/j.tcs.2017.06.001

Éditeur(s) : HAL CCSD
Résumé : International audience
Extract the features for a multi-touch gesture is difficult due to the complex temporal and motion relations between multiple trajectories. In this paper we present a new generic graph model to quantify the shape, temporal and motion information from multi-touch gesture. To make a comparison between graph, we also propose a specific graph matching method based on graph edit distance. Results prove that our graph model can be fruitfully used for multi-touch gesture pattern recognition purpose with the classifier of graph embedding and SVM.
17th Biennial Conference of the International Graphonomics Society
Pointe-à-Pitre, Guadeloupe

hal-01165768
https://hal.univ-antilles.fr/hal-01165768
https://hal.univ-antilles.fr/hal-01165768/document
https://hal.univ-antilles.fr/hal-01165768/file/IGS_2015_submission_6.pdf

Éditeur(s) : HAL CCSD Springer Verlag
Résumé : International audience
Intrinsic tribological properties of lamellar compounds are usually attributed to the presence of van der Waals gaps in their structure through which interlayer interactions are weak. The controlled variation of the distances and interactions between graphene layers by intercalation of electrophilic species in graphite is used in order to explore more deeply the friction reduction properties of low-dimensional compounds. Three graphite intercalation compounds with antimony pentachloride, iron trichloride and aluminium trichloride are studied. Their tribological properties are correlated to their structural parameters, and the interlayer interactions are deduced from ab initio bands structure calculations.
ISSN: 1023-8883

hal-00767639
https://hal.archives-ouvertes.fr/hal-00767639
https://hal.archives-ouvertes.fr/hal-00767639/document
https://hal.archives-ouvertes.fr/hal-00767639/file/Delbe_6330.pdf
DOI : 10.1007/s11249-012-9981-0

Éditeur(s) : HAL CCSD Elsevier
Résumé : International audience
ISSN: 0362-546X

hal-00816761
https://hal.univ-antilles.fr/hal-00816761
DOI : 10.1016/0362-546X(93)90065-Z

Éditeur(s) : HAL CCSD BioMed Central
Résumé : International audience
Background: Increasingly, similarity networks are being used for evolutionary analyses of molecular datasets. These networks are very useful, in particular for the analysis of gene sharing, lateral gene transfer and for the detection of distant homologs. Currently, such analyses require some computer programming skills due to the limited availability of user-friendly freely distributed software. Consequently, although appealing, the construction and analyses of these networks remain less familiar to biologists than do phylogenetic approaches. Results: In order to ease the use of similarity networks in the community of evolutionary biologists, we introduce a software program, EGN, that runs under Linux or MacOSX. EGN automates the reconstruction of gene and genome networks from nucleic and proteic sequences. EGN also implements statistics describing genetic diversity in these samples, for various user-defined thresholds of similarities. In the interest of studying the complexity of evolutionary processes affecting microbial evolution, we applied EGN to a dataset of 571,044 proteic sequences from the three domains of life and from mobile elements. We observed that, in Borrelia, plasmids play a different role than in most other eubacteria. Rather than being genetic couriers involved in lateral gene transfer, Borrelia's plasmids and their genes act as private genetic goods, that contribute to the creation of genetic diversity within their parasitic hosts. Conclusion: EGN can be used for constructing, analyzing, and mining molecular datasets in evolutionary studies. The program can help increase our knowledge of the processes through which genes from distinct sources and/or from multiple genomes co-evolve in lineages of cellular organisms.
ISSN: 1471-2148

hal-01544799
https://hal.archives-ouvertes.fr/hal-01544799
DOI : 10.1186/1471-2148-13-146