Sciweavers

6358 search results - page 111 / 1272
» Computing spectral sequences
Sort
View
BMCBI
2010
90views more  BMCBI 2010»
15 years 4 months ago
Local alignment of generalized k-base encoded DNA sequence
Background: DNA sequence comparison is a well-studied problem, in which two DNA sequences are compared using a weighted edit distance. Recent DNA sequencing technologies however o...
Nils Homer, Stanley F. Nelson, Barry Merriman
120
Voted
ICPR
2002
IEEE
16 years 4 months ago
Fast Restoration of Colour Movie Scratches
This paper presents a new type of scratch removal algorithm based on a causal adaptive multidimensional multitemporal prediction. The predictor use available information from the ...
Jirí Filip, Michal Haindl
111
Voted
IPPS
2002
IEEE
15 years 8 months ago
Aligning Two Fragmented Sequences
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to ...
Vamsi Veeramachaneni, Piotr Berman, Webb Miller
TIT
2008
103views more  TIT 2008»
15 years 3 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
MOC
2000
173views more  MOC 2000»
15 years 3 months ago
Computation of Gauss-Kronrod quadrature rules
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a...
Daniela Calvetti, Gene H. Golub, William B. Gragg,...