In polarized Madin-Darby canine kidney (MDCK) cells, the transferrin receptor (TR) is selectively delivered to the basolateral surface, where it internalizes transferrin via clathrin-coated pits and recycles back to the basolateral border. Mutant tailless receptors are sorted randomly in both the biosynthetic and endocytic pathways, indicating that the basolateral sorting of TR is dependent upo...

The pancake problem, which has attracted considerable attention, concerns the number of prefix reversals needed to sort the elements of an arbitrary permutation. The number of prefix reversals to sort permutations is also the diameter of the often studied n-dimensional Pancake network. We consider restricted pancake problem, when only k of the possible n− 1 prefix reversals are allowed.

Apical and basolateral proteins are maintained within distinct membrane subdomains in polarized epithelial cells by biosynthetic and postendocytic sorting processes. Sorting of basolateral proteins in these processes has been well studied; however, the sorting signals and mechanisms that direct proteins to the apical surface are less well understood. We previously demonstrated that an N-glycan-...

This paper studies new properties of the front and back ends of a sorting network, and illustrates the utility of these in the search for new bounds on optimal sorting networks. Search focuses first on the “outsides” of the network and then on the inner part. All previous works focus only on properties of the front end of networks and on how to apply these to break symmetries in the search. The...

Abstract. This paper considers integer sorting on a RAM. We show This paper considers integer sorting on a RAM. We show that adaptive sorting of a sequence with qn inversions is asymptotically equivalent to multisorting groups of at most q keys, and a total of n keys. Using the recent O(n √ log logn) expected time sorting of Han and Thorup on each set, we immediately get an adaptive expected so...

A new object sorting device using impulsive manipulation and air floating will be developed. First, two methods for impulsive object sorting are evaluated using computer simulation for the design of a sorting device. Second, an object sorting system with air floating will be developed. Finally, the developed system is evaluated experimentally.

This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...

The delivery to the plasma membrane of the general amino acid permease, Gap1p, of Saccharomyces cerevisiae is regulated by the quality of the nitrogen source in the growth medium. In an effort to define how different nitrogen sources control Gap1p sorting, we find that mutations in GDH1 and GLN1 that decrease the flux through the glutamate and glutamine synthesis pathways result in increased Ga...

This paper revisits the pairwise sorting network introduced by Parberry in the early 90’s. We provide a simple specification of the pairwise network which also clarifies its close resemblance to the more classic odd-even network introduced by Batcher in the mid 60’s. Finally we illustrate that pairwise networks are better suited than odd-even networks for the construction of selection networks.

This paper presents and analyzes algorithms for parallel execution of sort operations in a general multiprocessor architecture. We consider both internal and external sorting algorithms. For the latter, we study the performance of sorting algorithms that are derived from sorting algorithms that only do comparison and exchange by replacing each comparison-exchange with a B-way merge. In particul...