Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Loriot, Sebastien"'
Autor:
Loriot, Sebastien
Depuis les travaux précurseurs de Richard et al., les constructions géométriquesoccupent une place importante dans la description des macro-molécules et leurs assemblages.En particulier, certains complexes cellulaires liés au diagramme de Vorono
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00345002
http://tel.archives-ouvertes.fr/docs/00/34/50/02/PDF/SL_thesis.pdf
http://tel.archives-ouvertes.fr/docs/00/34/50/02/PDF/SL_thesis.pdf
Autor:
Cazals, Frédéric, Loriot, Sébastien
Publikováno v:
In Computational Geometry: Theory and Applications 2009 42(6):551-565
Publikováno v:
In Computational Geometry: Theory and Applications 2009 42(6):536-550
Publikováno v:
[Research Report] RR-6298, INRIA. 2007, pp.46
Computational Geometry
Computational Geometry, Elsevier, 2009
Computational Geometry, 2009
Computational Geometry
Computational Geometry, Elsevier, 2009
Computational Geometry, 2009
International audience; This paper presents a CGAL kernel for algorithms manipulating 3D spheres, circles, and circular arcs. The paper makes three contributions. First, the mathematics underlying two non trivial predicates are presented. Second, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::250d78a1b07d4ca9c7c2449c01db390c
https://hal.inria.fr/inria-00173124v2/file/rr3dCK.pdf
https://hal.inria.fr/inria-00173124v2/file/rr3dCK.pdf
Publikováno v:
Journées Ouvertes en Biologie, Informatique et Mathématiques (JOBIM)
Journées Ouvertes en Biologie, Informatique et Mathématiques (JOBIM), Société Française de Bioinformatique, Jul 2009, Nantes, France
Journées Ouvertes en Biologie, Informatique et Mathématiques (JOBIM), Société Française de Bioinformatique, Jul 2009, Nantes, France
International audience; Knowledge-based protein folding potentials have proven successful in the recent years. Based on statistics of observed interatomic distances, they generally encode pairwise contact information. In this study we present a metho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::07aba82dcc1882f8429e1a14a90627f1
https://inria.hal.science/inria-00429607
https://inria.hal.science/inria-00429607
Autor:
Cazals, Frédéric, Loriot, Sebastien
Publikováno v:
[Research Report] RR-7069, INRIA. 2009, pp.15
Intervor is a software computing a parameter free representation of macro-molecular interfaces, based on the alpha-complex of the atoms. Given two interacting partners, possibly with water molecules squeezed in-between them, Intervor computes an inte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::6f278aa254c85f5e1105a0501577dac5
https://inria.hal.science/inria-00426041/file/RR-7069.pdf
https://inria.hal.science/inria-00426041/file/RR-7069.pdf
Publikováno v:
[Research Report] RR-7013, INRIA. 2009, pp.25
Balls and spheres are amongst the simplest 3D modeling primitives, and computing the volume of a union of balls is an elementary problem. Although a number of strategies addressing this problem have been investigated in several communities, we are no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::efe7d99742e37489dffcea19cd654c32
https://inria.hal.science/inria-00409374/file/RR-7013.pdf
https://inria.hal.science/inria-00409374/file/RR-7013.pdf
Autor:
Caroli, Manuel, Machado Manhães De Castro, Pedro, Loriot, Sebastien, Rouiller, Olivier, Teillaud, Monique, Wormser, Camille
Publikováno v:
[Research Report] RR-7004, INRIA. 2009
We propose two approaches for computing the Delaunay triangulation of points on a sphere, or of rounded points close to a sphere, both based on the classic incremental algorithm initially designed for the plane. The space of circles gives the mathema
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a845431ceae0e38fad65a56a64e92090
https://hal.inria.fr/inria-00405478v4/file/RR-7004.pdf
https://hal.inria.fr/inria-00405478v4/file/RR-7004.pdf
Publikováno v:
[Research Report] RR-6503, INRIA. 2009
To address challenging flexible docking problems, a number of docking algorithms pre-generate large collections of candidate conformers. To remove the redundancy from such ensembles, a central problem in this context is to report a selection of confo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::520ce355f8c3d4257ba20a828f15f2d3
https://hal.inria.fr/inria-00252046v3/file/rr-v1.pdf
https://hal.inria.fr/inria-00252046v3/file/rr-v1.pdf
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.