Publications related to Sorting network

Design and construction of a microfluidics workstation for high-throughput multi-wavelength fluorescence and transmittance activated droplet analysis and sorting

Christoph Merten, Jatin Panwar, Alexis Louis Autour

Droplet microfluidics has revolutionized quantitative high-throughput bioassays and screening, especially in the field of single-cell analysis where applications include cell characterization, antibody discovery and directed evolution. However, droplet mic ...

NATURE PORTFOLIO2023

Towards a secure and trustworthy imaging with non-fungible tokens

Touradj Ebrahimi, Evgeniy Upenik, Davi Nachtigall Lazzarotto

Non fungible tokens (NFTs) are used to define the ownership of digital assets. More recently, there has been a surge of platforms to auction digital art as well as other digital assets in form of image, video, and audio content of all sorts. Although NFTs ...

2021

Computational methods for live heart imaging with speed-constrained microscopes

Olivia Mariani

Imaging methods to capture the beating and developing heart inside embryonic animal models such as the zebrafish are a key component for the study of fundamental biological processes such as cardiac birth defects or tissue regeneration. However, live heart ...

EPFL2021

Three-dimensional electrodes for dielectrophoretic applications

Kevin Keim

This thesis reports the use of metal-coated three-dimensional SU-8 electrodes for dielectrophoretic bio sensing and particle manipulation applications. Placing free standing three-dimensional electrodes in microfluidic channels, electric fields can be appl ...

EPFL2020

Efficient Learning from Comparisons

Lucas Maystre

Humans are comparison machines: comparing and choosing an item among a set of alternatives (such as objects or concepts) is arguably one of the most natural ways for us to express our preferences and opinions. In many applications, the analysis of data con ...

EPFL2018

Automated microfluidic sorting of mammalian cells labeled with magnetic microparticles for those that efficiently express and secrete a protein of interest

Amar Rida, Nicolas Mermod, Etienne Lançon, Niamh Harraghy

We developed a method for the fast sorting and selection of mammalian cells expressing and secreting a protein at high levels. This procedure relies on cell capture using an automated microfluidic device handling antibody-coupled magnetic microparticles an ...

Wiley2017

A bucket sort algorithm for the particle-in-cell method on manycore architectures

Laurent Villard, Stephan Brunner, Trach-Minh Tran, Claudio Gheller

The Particle-In-Cell (PIC) method is effectively used in many scientific simulation codes. In order to optimize the performance of the PIC approach, data locality is required. This relies on efficient sorting algorithms. We present a bucket sort algorithm ...

Springer2016

Size-dependent sorting of C. elegans nematodes through an adjustable microfluidic filter structure

Martinus Gijs, Thomas Lehnert, Matteo Cornaglia, Li Dong

We introduce a new and simple microfluidic sorting device based on adjustable filter structures that can be easily tuned by external pressure for a specific size-dependent C. elegans worm sorting experiment. A single device can be used for selecting and so ...

2016

Haplosufficiency of PAX3 for melanoma development in Tyr: NRASQ61K; Cdkn2a-/- mice allows identification and sorting of melanoma cells using a Pax3GFP reporter allele

Friedrich Beermann

The role of the Pax3 gene in embryonic development of pigment cells is well characterized. By contrast, the function of Pax3 in melanoma development is controversial. Indeed, data obtained from cultured cells suggest that PAX3 may contribute to melanomagen ...

Lippincott Williams & Wilkins2016

Calibration method and system

Martin Vetterli, Ivan Dokmanic

The present invention concerns a method for calibrating an array of receivers (ri), each receiver being configured for receiving a signal transmitted by at least one transmitter (si), and echoes of the transmitted signal as reflected by one or more reflect ...

2014

Tight Bounds for Asynchronous Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual ...

Association for Computing Machinery2014

Cracking The Complexity Of Fixed-Point Refinement In Complex Wireless Systems

Paolo Ienne, David Novo Bruna

Fixed-point arithmetic leads to efficient implementations. However, the optimization process required to size each of the implementation signals can be prohibitively complex. In this paper, we introduce a new divide-and-conquer method that is able to appro ...

Ieee2013

Randomized versus Deterministic Implementations of Concurrent Data Structures

Dan Alistarh

One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are now the norm, and at the system level, where many key services are currently distributed overmulti ...

EPFL2012

Sorting Live Stem Cells Based on Sox2 mRNA Expression

Matthias Lütolf, Peter Frey, Jeffrey Alan Hubbell, Hans Mattias Larsson, Seung Tae Lee

While cell sorting usually relies on cell-surface protein markers, molecular beacons (MBs) offer the potential to sort cells based on the presence of any expressed mRNA and in principle could be extremely useful to sort rare cell populations from primary i ...

Public Library of Science2012

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

We give two new randomized algorithms for tight renaming, both of which work against an adaptive adversary. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Sorting signed permutations by inversions in O(nlogn) time

Bernard Moret, Yu Lin, Vaibhav Rajan, Krister Swenson

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inv ...

2010

A Weighting Scheme for Enhancing Community Detection in Networks

Martin Hasler, Alireza Khadivi

Many algorithms have recently been proposed for finding communities in networks. By definition, a community is a subset of vertices with a high number of connections among the vertices, but only few connections with other vertices. The worst drawback of mo ...

IEEE2010

Sorting signed permutations by inversions in O(nlogn) time

Bernard Moret, Yu Lin, Vaibhav Rajan, Krister Swenson

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inv ...

Springer2009

Controlled entrapment of cells in hydrogels on chip and cell sorting by dielectrophoresis using liquid electrodes

Thomas Michael Braschler

Alginate gel formation on-chip is presented in the first part of this thesis. The technique allows immobilization, and release, of biological cells on-chip. Furthermore, via layer by layer deposition, a locally heterogeneous environment can be generated at ...

EPFL2009

Efficient Broadcasting Using Network Coding

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

We consider the problem of broadcasting in an ad-hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless netwo ...

2008