Publication

Cell sorting by dielectrophoresis for evaluation of lysis efficiency in continuous flow

Philippe Renaud
2010
Conference Papers

Abstract

This paper reports on a device capable of electrical cell lysis and evaluation of lysis efficiency in continuous flow using dielectrophoretic cell sorting. The device uses an innovative design, called liquid electrodes, to perform both cell lysis and cell sorting. A study of the cell position after sorting shows a very efficient lysis when a voltage of 55 Vpp is applied, whereas a voltage of 28Vpp does not induce any lysis.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Philippe Renaud
2010
Conference Papers

Abstract

Official source

Related concepts (32)

Integer sorting

In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by integer keys. Algorithms designed for integer sorting may also often be applied to sorting problems in which the keys are floating point numbers, rational numbers, or text strings. The ability to perform integer arithmetic on the keys allows integer sorting algorithms to be faster than comparison sorting algorithms in many cases, depending on the details of which operations are allowed in the model of computing and how large the integers to be sorted are.

Merge sort

In computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the relative order of equal elements is the same in the input and output. Merge sort is a divide-and-conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up merge sort appeared in a report by Goldstine and von Neumann as early as 1948.

Sorting network

In computer science, comparator networks are abstract devices built up of a fixed number of "wires", carrying values, and comparator modules that connect pairs of wires, swapping the values on the wires if they are not in a desired order. Such networks are typically designed to perform sorting on fixed numbers of values, in which case they are called sorting networks. Sorting networks differ from general comparison sorts in that they are not capable of handling arbitrarily large inputs, and in that their sequence of comparisons is set in advance, regardless of the outcome of previous comparisons.

Related publications (2)

Cell sorting by dielectrophoresis for evaluation of lysis efficiency in continuous flow

Chat with Graph Search

RACE: Towards Exploring the Design Dimensions of a Route Assisting and Communicating System for Elderly

Estimates of lightning-induced voltage stresses within buried shielded conduits