Sciweavers

62 search results - page 6 / 13
» Faster Algorithms for Computing Longest Common Increasing Su...
Sort
View
FCT
2005
Springer
14 years 27 days ago
Fully Incremental LCS Computation
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, ...
ICPR
2004
IEEE
14 years 8 months ago
Extraction and Clustering of Motion Trajectories in Video
A system is described that tracks moving objects in a video dataset so as to extract a representation of the objects' 3D trajectories. The system then finds hierarchical clus...
Dan Buzan, George Kollios, Stan Sclaroff
TCBB
2010
114views more  TCBB 2010»
13 years 5 months ago
Cache-Oblivious Dynamic Programming for Bioinformatics
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
Rezaul Alam Chowdhury, Hai-son Le, Vijaya Ramachan...
IEEESCC
2009
IEEE
13 years 5 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
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...