Sciweavers

105 search results - page 16 / 21
» A Fast and Space - Economical Algorithm for Length - Limited...
Sort
View
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 2 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
SAC
2010
ACM
13 years 8 months ago
FANGS: high speed sequence mapping for next generation sequencers
Next Generation Sequencing machines are generating millions of short DNA sequences (reads) everyday. There is a need for efficient algorithms to map these sequences to the referen...
Sanchit Misra, Ramanathan Narayanan, Simon Lin, Al...
BMCBI
2006
110views more  BMCBI 2006»
13 years 8 months ago
CpGcluster: a distance-based algorithm for CpG-island detection
Background: Despite their involvement in the regulation of gene expression and their importance as genomic markers for promoter prediction, no objective standard exists for defini...
Michael Hackenberg, Christopher Previti, Pedro Lui...
CORR
2006
Springer
145views Education» more  CORR 2006»
13 years 8 months ago
Algebraic Signal Processing Theory
In [1], we presented the algebraic signal processing theory, an axiomatic and general framework for linear signal processing. The basic concept in this theory is the signal model d...
Markus Püschel, José M. F. Moura
CSDA
2007
105views more  CSDA 2007»
13 years 8 months ago
Calculation of simplicial depth estimators for polynomial regression with applications
A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial regression model is derived. Additionally, an algorithm for calculating the para...
R. Wellmann, S. Katina, Ch. H. Müller