Assessment of immediate conservative breast surgery reconstruction: A classification system of defects revisited and an algorithm for selecting the appropriate technique

Background: Although various techniques have been used for breast conservation surgery reconstruction, there are few studies describing a logical approach to reconstruction of these defects. The objectives of this study were to establish a classification system for partial breast defects and to develop a reconstructive algorithm. Methods: The authors reviewed a 7-year experience with 209 immediate breast conservation surgery reconstructions. Mean follow-up was 31 months. Type I defects include tissue resection in smaller breasts (bra size A/B), including type IA, which involves minimal defects that do not cause distortion; type III, which involves moderate defects that cause moderate distortion; and type IC, which involves large defects that cause significant deformities. Type II includes tissue resection in medium-sized breasts with or without ptosis (bra size C), and type III includes tissue resection in large breasts with ptosis (bra size D). Results: Eighteen percent of patients presented type I, where a lateral thoracodorsal flap and a latissimus dorsi flap were performed in 68 percent. Forty-five percent presented type II defects, where bilateral mastopexy was performed in 52 percent. Thirty-seven percent of patients presented type III distortion, where bilateral reduction mammaplasty was performed in 67 percent. Thirty-five percent of patients presented complications, and most were minor. Conclusions: An algorithm based on breast size in relation to tumor location and extension of resection can be followed to determine the best approach to reconstruction. The authors` results have demonstrated that the complications were similar to those in other clinical series. Success depends on patient selection, coordinated planning with the oncologic surgeon, and careful intraoperative management.

Equivalent Neurogenic Potential of Wild-Type and GFP-Labeled Fetal-Derived Neural Progenitor Cells Before and After Transplantation Into the Rodent Hippocampus

Introduction. The hippocampal formation is a specific structure in the brain where neurogenesis occurs throughout adulthood and in which the neuronal cell loss causes various demential states. The main goal of this study was to verify whether fetal neural progenitor cells (NPCs) from transgenic rats expressing green fluorescent protein (GFP) retain the ability to differentiate into neuronal cells and to integrate into the hippocampal circuitry after transplantation. Methods. NPCs were isolated from E14 (gestational age: 14 days postconception) transgenic-Lewis and wild-type Sprague-Dawley rat embryos. Wild-type and transgenic cells were expanded and induced to differentiate into a neuronal lineage in vitro. Immunocytochemical and electrophysiological analysis were performed in both groups. GFP-expressing cells were implanted into the hippocampus and recorded electrophysiologically 3 months thereafter. Immunohistochemical analysis confirmed neuronal differentiation, and the yield of neuronal cells was determined stereologically. Results. NPCs derived from wild-type and transgenic animals are similar regarding their ability to generate neuronal cells in vitro. Neuronal maturity was confirmed by immunocytochemistry and electrophysiology, with demonstration of voltage-gated ionic currents, firing activity, and spontaneous synaptic currents. GFP-NPCs were also able to differentiate into mature neurons after implantation into the hippocampus, where they formed functional synaptic contacts. Conclusions. GFP-transgenic cells represent an important tool in transplantation studies. Herein, we demonstrate their ability to generate functional neurons both in vitro and in vivo conditions. Neurons derived from fetal NPCs were able to integrate into the normal hippocampal circuitry. The high yield of mature neurons generated render these cells important candidates for restorative approaches based on cell therapy.

X-linked neonatal diabetes mellitus, enteropathy and endocrinopathy syndrome is the human equivalent of mouse scurfy

To determine whether human X-linked neonatal diabetes mellitus, enteropathy and endocrinopathy syndrome (IPEX; MIM 304930) is the genetic equivalent of the scurfy (sf) mouse, we sequenced the human ortholog (FOXP3) of the gene mutated in scurfy mice (Foxp3), in IPEX patients. We found four non-polymorphic mutations. Each mutation affects the forkhead/winged-helix domain of the scurfin protein, indicating that the mutations may disrupt critical DNA interactions.

Generation of eigenstates using the phase-estimation algorithm

The phase estimation algorithm is so named because it allows an estimation of the eigenvalues associated with an operator. However, it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this proposal for small quantum systems, identifying the conditions under which the phase-estimation algorithm can successfully generate eigenstates. We then propose an implementation scheme based on an ion trap quantum computer. This scheme allows us to illustrate two simple examples, one in which the algorithm effectively generates eigenstates, and one in which it does not.

An algorithm to predict 3 ' intron splice sites in Plasmodium falciparum genomic sequences

A new algorithm, PfAGSS, for predicting 3' splice sites in Plasmodium falciparum genomic sequences is described. Application of this program to the published P. falciparum chromosome 2 and 3 data suggests that existing programs result in a high error rate in assigning 3' intron boundaries. (C) 2001 Elsevier Science B.V. All rights reserved.

A simulated annealing algorithm for finding consensus sequences

Motivation: A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules. Results: This paper describes a new algorithm for finding a consensus sequence, using the popular optimization method known as simulated annealing. Unlike the conventional approach of finding a consensus sequence by first forming a multiple sequence alignment, this algorithm searches for a sequence that minimises the sum of pairwise distances to each of the input sequences. The resulting consensus sequence can then be used to induce a multiple sequence alignment. The time required by the algorithm scales linearly with the number of input sequences and quadratically with the length of the consensus sequence. We present results demonstrating the high quality of the consensus sequences and alignments produced by the new algorithm. For comparison, we also present similar results obtained using ClustalW. The new algorithm outperforms ClustalW in many cases.

An equivalent waveguide approach to designing of reflect arrays with the use of variable-size microstrip patches

An equivalent unit cell waveguide approach (WGA) is described to study the behavior of a multilayer reflect array of variable-size patches/dipoles, The approach considers normal incidence of a plane wave on an infinite periodic array of identical radiating elements and introduces an equivalent unit cell waveguide to obtain the reflection coefficient. A field matching technique and method of moments (MoM) is used to determine fields in different layers of the equivalent waveguide. Good agreements for the phase of the reflection coefficient between the proposed model and those published in selected literatures are obtained. (C) 2002 Wiley Periodicals, Inc.

A monolithic smoothing-gap algorithm for contact-impact based on the signed distance function

A new algorithm has been developed for smoothing the surfaces in finite element formulations of contact-impact. A key feature of this method is that the smoothing is done implicitly by constructing smooth signed distance functions for the bodies. These functions are then employed for the computation of the gap and other variables needed for implementation of contact-impact. The smoothed signed distance functions are constructed by a moving least-squares approximation with a polynomial basis. Results show that when nodes are placed on a surface, the surface can be reproduced with an error of about one per cent or less with either a quadratic or a linear basis. With a quadratic basis, the method exactly reproduces a circle or a sphere even for coarse meshes. Results are presented for contact problems involving the contact of circular bodies. Copyright (C) 2002 John Wiley Sons, Ltd.

A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search. (C) 2002 Elsevier Science Ltd. All rights reserved.