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.

Multiplex semi-nested RT-PCR with exogenous internal control for simultaneous detection of bovine coronavirus and group A rotavirus

Neonatal calf diarrhea is a multi-etiology syndrome of cattle and direct detection of the two major agents of the syndrome, group A rotavirus and Bovine coronavirus (BCoV) is hampered by their fastidious growth in cell culture. This study aimed at developing a multiplex semi-nested RT-PCR for simultaneous detection of BCoV (N gene) and group A rotavirus (VP1 gene) with the addition of an internal control (mRNA ND5). The assay was tested in 75 bovine feces samples tested previously for rotavirus using PAGE and for BCoV using nested RT-PCR targeted to RdRp gene. Agreement with reference tests was optimal for BCoV (kappa = 0.833) and substantial for rotavirus detection (kappa = 0.648). the internal control, ND5 mRNA, was detected successfully in all reactions. Results demonstrated that this multiplex semi-nested RT-PCR was effective in the detection of BCoV and rotavirus, with high sensitivity and specificity for simultaneous detection of both viruses at a lower cost, providing an important tool for studies on the etiology of diarrhea in cattle. (C) 2010 Elsevier B.V. All rights reserved.

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.

A semi-analytical solution for vibration of rectangular plates with abrupt thickness variation

A semi-analytical analysis of free vibration of plates with cross-sectional discontinuities due to abrupt changes in thickness is presented. A basic square element divided into suitable subdomains dependent upon the positions of these abrupt changes is used as the basic building element, Admissible functions that satisfy the essential or geometric boundary conditions are used to define the transverse deflection of each subdomain. Continuities in the displacement, slope, moment and higher derivatives between adjacent subdomains are enforced at the interconnecting edges. The resulting global energy functional from the proper assembly of the coupled strain and kinetic energy contributions of each subdomain is then minimized via the Ritz procedure to extract the frequencies and mode shapes. Contour plots of a range of new mode shapes are presented for the enhancement of understanding the dynamic behavior of this class of plates, (C) 2001 Elsevier Science Ltd, All rights reserved.

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.