4302 search results - page 8 / 861 » Index Pairs Algorithms |
AAIM
2007
Springer
2007
Springer
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
14 years 1 months ago
We study three closely related problems motivated by the prediction of RNA secondary structures with arbitrary pseudoknots: the MAXIMUM BASE PAIR STACKINGS problem proposed by Ieon...
IPL
2002
13 years 7 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
AMC
2007
13 years 7 months ago
2007
In 2006, Blake, Murty and Xu proposed three refinements to Miller’s algorithm for computing Weil/Tate Pairings. In this paper we extend their work and propose a generalized algo...
BMCBI
2010
13 years 7 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...