Sciweavers

16 search results - page 3 / 4
» Dynamic programming algorithms for the mosaic longest common...
Sort
View
WOB
2004
120views Bioinformatics» more  WOB 2004»
13 years 8 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...
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 7 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
IFIP
2004
Springer
14 years 21 days ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
KBSE
2006
IEEE
14 years 1 months ago
Sieve: A Tool for Automatically Detecting Variations Across Program Versions
Software systems often undergo many revisions during their lifetime as new features are added, bugs repaired, abstractions simplified and refactored, and performance improved. Wh...
Murali Krishna Ramanathan, Ananth Grama, Suresh Ja...
ICCAD
2009
IEEE
106views Hardware» more  ICCAD 2009»
13 years 5 months ago
An efficient pre-assignment routing algorithm for flip-chip designs
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fan...