Publication

Conformational analysis of nucleic acids revisited: Curves

Related publications (36)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Sampling Curves with Finite Rate of Innovation

Thierry Blu, Hanjie Pan, Pier Luigi Dragotti

We focus on a specific class of curves that can be parametrized using a finite number of variables in two dimensions. The corresponding indicator plane, which is a binary image, has infinite bandwidth and can not be sampled and perfectly reconstructed with ...

2011

Ideal knots and other packing problems of tubes

Henryk Gerlach

This thesis concerns optimal packing problems of tubes, or thick curves, where thickness is defined as follows. Three points on a closed space curve define a circle. Taking the infimum over all radii of pairwise-distinct point triples defines the thickness ...

EPFL2010

Sur la méthode de Buser-Silhol pour l'uniformisation des surfaces de Riemann hyperelliptiques

Grégoire Aubry

The Uniformization Theorem due to Koebe and Poincaré implies that every compact Riemann surface of genus greater or equal to 2 can be endowed with a metric of constant curvature – 1. On the other hand, a compact Riemann surface is a complex algebraic curve ...

EPFL2010

Direct measurement of drainage curves in infiltration of SiC particle preforms

Andreas Mortensen, Ludger Weber, Maryam Bahraini Hasani

Drainage curves (plots of the non-wetting fluid saturation versus applied pressure) for infiltration of SiC particle preforms with Al and Al-12.2 at.% Si are measured at 1023 K (750 degrees C) with a pressure infiltration apparatus adapted for direct track ...

2008

Ate Pairing on Hyperelliptic Curves

Robert Granger

In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to hyperelliptic curves and in fact to arbitrary algebraic curves. It has the following surprising properties: The loop length in Miller’s algorithm can be up t ...

Springer-Verlag Berlin Heidelberg2007

Improved method of nucleotide detection

Gerardo Turcatti

The invention relates to an additive which can be added to buffers used in nucleotide detection processes and improved methods of nucleic acid sequencing using this additive. In particular the invention relates to use of the additive to improve the efficie ...

2007

Some remarks on the uniformizing function in genus 2

Robert Silhol

The authors propose a numerical method for the uniformization of Riemann surfaces and algebraic curves in genus two with highly accurate results. Let

G

be a Fuchsian group acting on the unit disk

Bbb D

, and let

S = Bbb D / G

. It is well known that $S ...

Kluwer Academic Publishers, Springer2005

Global radii of curvature, and the biarc approximation of space curves

Jana Smutny

The distance from self-intersection of a (smooth and either closed or infinite) curve q in three dimensions can be characterised via the global radius of curvature at q(s), which is defined as the smallest possible radius amongst all circles passing throug ...

EPFL2004

Non-linear subdivision using local spherical coordinates

Touradj Ebrahimi, Pierre Vandergheynst, Nicolas Aspert

In this paper, we present an original non-linear subdivision scheme suitable for univariate data, plane curves and discrete triangulated surfaces, while keeping the complexity acceptable. The proposed technique is compared to linear subdivision methods hav ...

2003

Computation of the discrete logarithm on elliptic curves of trace one

Jean Monnerat

The security of several elliptic curve cryptosystems is based on the difficulty to compute the discrete logarithm problem. The motivation of using elliptic curves in cryptography is that there is no known sub-exponential algorithm which solves the Elliptic ...

2002