Sciweavers

514 search results - page 70 / 103
» Approximate Periods of Strings
Sort
View
147
Voted
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 8 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
132
Voted
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 7 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
158
Voted
CIKM
2008
Springer
15 years 5 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
160
Voted
JCC
2010
113views more  JCC 2010»
15 years 2 months ago
MDLab: A molecular dynamics simulation prototyping environment
Molecular dynamics (MD) simulation involves solving Newton’s equations of motion for a system of atoms, by calculating forces and updating atomic positions and velocities over a...
Trevor M. Cickovski, Santanu Chatterjee, Jacob Wen...
124
Voted
ICIP
2006
IEEE
16 years 5 months ago
A New Method for Boundary-Based Shape Matching and Retrieval
This paper presents a novel method for efficient boundary based shapes matching and retrieval in presence of occlusion. In this method, the geometric and topological information o...
Minh-Son Dao, Raffaele de Amicis