Sciweavers

53 search results - page 4 / 11
» A Fast Bit-Vector Algorithm for Approximate String Matching ...
Sort
View
PCM
2004
Springer
144views Multimedia» more  PCM 2004»
13 years 11 months ago
Dynamic Programming Based Adaptation of Multimedia Contents in UMA
Content adaptation is an effective solution to support the quality of service for multimedia services over heterogeneous networks. This paper deals with the accuracy and the real-...
Truong Cong Thang, Yong Ju Jung, Yong Man Ro
WOB
2004
120views Bioinformatics» more  WOB 2004»
13 years 7 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...
GCB
2004
Springer
223views Biometrics» more  GCB 2004»
13 years 9 months ago
PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
Michael Beckstette, Dirk Strothmann, Robert Homann...
DEXA
2007
Springer
150views Database» more  DEXA 2007»
13 years 12 months ago
Sequence Alignment as a Database Technology Challenge
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...
Hans Philippi
EMMCVPR
2003
Springer
13 years 11 months ago
Curve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
Max Frenkel, Ronen Basri