52 search results - page 1 / 11 » Algebraic fingerprints for faster algorithms |
BMCBI
2007
13 years 5 months ago
2007
Background: The Sulston score is a well-established, though approximate metric for probabilistically evaluating postulated clone overlaps in DNA fingerprint mapping. It is known t...
ISPEC
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. In this paper we discuss the problem of collusion secure fingerprinting. In the first part of our contribution we prove the existence of equidistant codes that can be u...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
ARITH
1993
IEEE
13 years 9 months ago
1993
IEEE
An attractive paradigm for building fast numerical algorithms is the following: 1 try a fast but occasionally unstable algorithm, 2 test the accuracy of the computed answer, a...
BMCBI
2008
13 years 5 months ago
2008
Background: We present a methodology for high-throughput design of oligonucleotide fingerprints for microarray-based pathogen diagnostic assays. The oligonucleotide fingerprints, ...