We present exact algorithms for the NP-complete Longest Common Subsequence problem for sequences with nested arc annotations, a problem occurring in structure comparison of RNA. Given two sequences of length at most n and nested arc structure, one of our algorithms determines (if existent) in O(3.31k1+k2 · n) time an arc-preserving subsequence of both sequences, which can be obtained by deletin...

The production of ultra-short x-rays in Cornell’s Energy Recovery Linac (ERL) requires electron bunch lengths of less than 100fs with minimal transverse emittance growth and energy spread. Because the linac consists of two sections separated by an arc, CSR forces limit the bunch length in the linac, and bunch compression has to be done after acceleration. Creation of such short bunches requires...

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph G is defined to have vertices the arcs of G such that two arcs uv, xy are adjacent if and only if (v, u, x, y) is a 3-arc of G. In this paper we prove that any connected 3-arc graph is Hamiltonian, and all iterative 3-...

Statistical shape analysis has become of increasing interest to the neuroimaging community due to its potential to locate morphological changes. In this paper, we present the a novel combination of shape analysis and Diffusion Tensor Image (DTI) Tractography to the computation of a probabilistic, model based corpus callosum (CC) subdivision. The probabilistic subdivision is based on the distanc...