We address the problem of generating entire course sequences, given a set of target skills together with possibly prioritized preferences over course descriptions. The objective is to support students in defining personalized curricula.

We generalize Freudenthal’s theory of irreducible representations of metrizable compacta by inverse sequences of compact polyhedra to the class of all metrizable spaces. Our representations consist of inverse sequences of completely metrizable polyhedra which are ANR’s. They are extendable: any such representation of a closed subspace of a given metrizable space extends to another such of the e...

We present an optimal timing control formulation for the problem of controlling autonomous puppets. In particular, by appropriately timing the different movements, entire plays can be performed. Such plays are produced by concatenating sequences of motion primitives and a compiler optimizes these sequences, using recent results in optimal switch-time control. Additionally, we apply saddle-point...

Computational approaches to sequence alignment fall into two categories: local alignment and global alignment. Global alignment is a form a global optimization that forces the alignment to span the entire length of all query sequences. On the other hand, local alignments identify regions of similarity within long sequences that are often widely divergent overall. Local alignments can be difficu...

We present an extension of Felsenstein’s algorithm to indel models defined on entire sequences, without the need to condition on one multiple alignment. The algorithm makes use of a generalization from probabilistic substitution matrices to weighted finite-state transducers. Our approach may equivalently be viewed as a probabilistic formulation of progressive multiple sequence alignment, using ...

We describe our preliminary experience with the half-Fourier acquisition single-shot turbo spin-echo (HASTE) sequences for MR imaging of the salivary gland ducts. In the majority of patients, the main parotid and/or submandibular gland ducts and large branches within the glands were detectable on MR images obtained in 2 seconds per section and within 3 minutes for the entire examination. MR sia...

Databases of DNA and protein sequences are growing at an alarming rate as biologists map entire genomes. Faster methods of searching these databases are becoming more important. The method of dot matrix plots provides biologists with a complete picture of homology between two DNA or protein sequences. Parallel computation provides a faster means of generating simple unnltered plots, which can t...

The two haploid genome sequences that a person inherits from the two parents represent the most fundamentally useful type of genetic information for the study of heritable diseases and the development of personalized medicine. Because of the difficulty in obtaining long-range phase information, current sequencing methods are unable to provide this information. Here, we introduce and show feasib...

DNA barcodes have achieved prominence as a tool for species-level identifications. Consequently, there is a rapidly growing database of these short sequences from a wide variety of taxa. In this study, we have analyzed the correlation between the nucleotide content of the short DNA barcode sequences and the genomes from which they are derived. Our results show that such short sequences can yiel...