An O (n2) heuristic algorithm for the directed Steiner minimal tree problem

This paper describes the design of an O(N²) heuristic algorithm for the Directed Steiner Minimal Tree (DSMT) problem in the plane. The algorithm employs the Delaunay triangulation, a minimum spanning arborescence algorithm, and a triangulation of the arborescence to develop solutions to the DSMT problem. Example applications are also included.     

Callosal connections of dorsal versus ventral premotor areas in the macaque monkey: a multiple retrograde tracing study

Background  

The lateral premotor cortex plays a crucial role in visually guided limb movements. It is divided into two main regions, the dorsal (PMd) and ventral (PMv) areas, which are in turn subdivided into functionally and anatomically distinct rostral (PMd-r and PMv-r) and caudal (PMd-c and PMv-c) sub-regions. We analyzed the callosal inputs to these premotor subdivisions following 23 injections of retrograde tracers in eight macaque monkeys. In each monkey, 2–4 distinct tracers were injected in different areas allowing direct comparisons of callosal connectivity in the same brain.     

Facile synthesis of a chiral polymeric helix; folding by intramolecular hydrogen bonding

In a single condensation step, a poly-ureidophthalimide is synthesized, which folds into a chiral, helical architecture according to circular dichroism spectroscopy.