199 search results - page 12 / 40 » Sequences of low arithmetical complexity |
BMCBI
2010
14 years 11 months ago
2010
Background: High-throughput automated sequencing has enabled an exponential growth rate of sequencing data. This requires increasing sequence quality and reliability in order to a...
RECOMB
2009
Springer
16 years 8 days ago
2009
Springer
Abstract. Accurate comparative analysis tools for low-homology proteins remains a difficult challenge in computational biology, especially sequence alignment and consensus folding ...
105
Voted
TWC
2010
14 years 6 months ago
2010
In this paper, the training sequence design for multiple-input multiple-output (MIMO) orthogonal frequencydivision multiplexing (OFDM) systems under the minimum mean square error (...
113
click to vote
ISAAC
2007
Springer
15 years 5 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
59
Voted
AAECC
2007
Springer
15 years 5 months ago
2007
Springer
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...