Biomechanics of glutaraldehyde-treated porcine aortic roots and valves

The biomechanics and function of fresh porcine aortic roots and valves have been compared with those of glutaraldehyde-treated roots prepared in a conventional manner without dilation of the elastic aortic root and with glutaraldehyde-treated roots prepared with permanent predilation during fixation. The glutaraldehyde-treated aortic walls were significantly less extensible than fresh walls, with a mean dilation of only 6 % compared with 45% for the fresh root at 120 mm Hg pressure. Permanent predilation of the aortic root during fixation allowed the total dilation of the fixed root to be increased to 19% at 120 mm Hg pressure. The effective orifice area of the fresh root and valve was significantly greater than those of the fixed roots and valves, with permanent predilation fixation producing a significantly greater orifice area than conventional fixation. The open-leaflet bending deformations were found to be lower in the valves fixed after permanent predilation than in the standard fixed valves. The glutaraldehyde-treated porcine root and valve does not reproduce the biomechanics and function of the fresh root, because of the reduced extensibility of the fixed aortic wall. Permanent predilation during fixation helps to partially overcome the shortcomings of the fixed root, producing better function than a standard fixed valve

Minimum common string partition problem: Hardness and approximations

Abstract. String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address the minimum common string partition problem, a string comparison problem with tight connection to the problem of sorting by reversals with duplicates, a key problem in genome rearrangement. A partition of a string A is a sequence P = (P1, P2,..., Pm) of strings, called the blocks, whose concatenation is equal to A. Given a partition P of a string A and a partition Q of a string B, we say that the pair 〈P, Q 〉 is a common partition of A and B if Q is a permutation of P. The minimum common string partition problem (MCSP) is to find a common partition of two strings A and B with the minimum number of blocks. The restricted version of MCSP where each letter occurs at most k times in each input string, is denoted by k-MCSP. In this paper, we show that 2-MCSP (and therefore MCSP) is NP-hard and, moreover, even APX-hard. We describe a 1.1037-approximation for 2-MCSP and a linear time 4-approximation algorithm for 3-MCSP. We are not aware of any better approximations.

Finding an optimal inversion median: experimental results

Abstract. We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree using simple geometric properties of the problem and a newly available linear-time routine for inversion distance. Our experiments on simulated data sets indicate that the algorithm finds optimal medians in reasonable time for genomes of medium size when distances are not too large, as commonly occurs in phylogeny reconstruction. In addition, we have compared inversion and breakpoint medians, and found that inversion medians generally score significantly better and tend to be far more unique, which should make them valuable in median-based tree-building algorithms.