This paper addresses the partial shape matching problem, which helps identifying similarities even when a significant portion of one shape is occluded, or seriously distorted. We introduce a measure for computing the similarity between multiple polylines and a polygon, that can be computed in O(kmn) time with a straightforward dynamic programming algorithm. We then present a novel fast algorith...

Text matching with errors is a regular task in computational biology. We present an extension of the bit-parallel Wu-Manber algorithm [16] to combine several searches for a pattern into a collection of fixed-length words. We further present an OpenCL parallelization of a redundant index on massively parallel multicore processors, within a framework of searching for similarities with seed-based ...

Drosophila Dscam encodes a vast family of immunoglobulin (Ig)-containing proteins that exhibit isoform-specific homophilic binding. This diversity is essential for cell recognition events required for wiring the brain. Each isoform binds to itself but rarely to other isoforms. Specificity is determined by "matching" of three variable Ig domains within an approximately 220 kD ectodomain. Here, w...

Model reduction by moment matching for linear time-invariant (LTI) models is a technique that has clear interpretation in the Laplace domain. In particular, multiple-input multiple-output (MIMO) LTI case, Krylov subspace methods aim at transfer-function matrix (and possibly its derivatives) of reduced-order model to full-order along so-called tangential directions desired interpolation points. ...

It is well known that non-random attrition can lead to bias in estimating treatment effects from a social experiment that is based on random assignment. If the randomized intervention suffers from non-random attrition, the intent to treat (ITT) estimator is biased and the IV estimator of the treatment effect is also inconsistent (Frangakis and Rubin 1999). DiNardo, McCrary and Sanbonmatsu (2006...