10146 search results - page 91 / 2030 » Fast FAST |
103
click to vote
BIRD
2007
Springer
15 years 6 months ago
2007
Springer
Fast search algorithms for finding good instances of patterns given as position specific scoring matrices are developed, and some empirical results on their performance on DNA sequ...
113
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduc...
119
click to vote
AMC
2006
15 years 2 months ago
2006
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. Based on the double-base chain representation of scalar using...
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an...