Molecular characterization of circulating tumor cells in lung cancer: moving beyond enumeration
Lei WangCoraline DuménilCatherine JuliéViolaine GiraudJennifer DumoulinSylvie LabruneThierry ChinetJean‐François EmileBiao HeEtienne Giroux‐Leprieur
6
Citation
167
Reference
10
Related Paper
Citation Trend
Abstract:
// Lei Wang 1, 2 , Coraline Dumenil 3 , Catherine Julié 4, 5 , Violaine Giraud 3 , Jennifer Dumoulin 3 , Sylvie Labrune 3 , Thierry Chinet 3, 5 , Jean-François Emile 4, 5 , Biao He 2 and Etienne Giroux Leprieur 3, 5 1 Department of Thoracic Surgery, Fourth Hospital of Hebei Medical University, Shijiazhuang, Hebei, China 2 Thoracic Oncology Program, Department of Surgery, Helen Diller Family Comprehensive Cancer Center, University of California, San Francisco, CA, USA 3 Department of Respiratory Diseases and Thoracic Oncology, APHP – Ambroise Pare Hospital, Boulogne-Billancourt, France 4 Department of Pathology, APHP – Ambroise Pare Hospital, Boulogne-Billancourt, France 5 EA 4340 "Biomarqueurs en Cancérologie et Onco-Hématologie" UVSQ, Paris-Saclay University, Boulogne-Billancourt, France Correspondence to: Etienne Giroux Leprieur, email: etienne.girouxleprieur@aphp.fr Keywords: lung cancer; circulating tumor cells; prognosis; predictive marker; molecular diagnosis Received: August 05, 2017 Accepted: September 20, 2017 Published: November 23, 2017 ABSTRACT Molecular characterization of tumor cells is a key step in the diagnosis and optimal treatment of lung cancer. However, analysis of tumor samples, often corresponding to small biopsies, can be difficult and does not accurately reflect tumor heterogeneity. Recent studies have shown that isolation of circulating tumor cells (CTCs) is feasible in non-small cell lung cancer patients, even at early disease stages. The amount of CTCs corresponds to the metastatic potential of the tumor and to patient prognosis. Moreover, molecular analyses, even at the single-cell level, can be performed on CTCs. This review describes the technologies currently available for detecting and capturing CTCs, the potential for downstream molecular diagnostics, and the clinical applications of CTCs isolated from lung cancer patients as screening, prognostic, and predictive tools. Main limitations of CTCs are also discussed.Keywords:
Enumeration
Circulating tumor cell
In this paper we have investigated enumeration orders of elements of r.e. sets enumerated by means of Turing machines. We have defined a reducibility based on enumeration orders named "Enumeration Order Reducibility" on computable functions and also r.e. sets and studied their properties. Based on this reducibility we introduce an equivalence relation "Enumeration Order Equivalency". We have reached some properties of it. In subsequent, we have introduced another concept named "type-2 Enumeration Order Equivalency" and studied its properties too.
Enumeration
Equivalence relation
Turing
Cite
Citations (0)
Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package WilfPlus , which implements this process. We also compare enumeration schemes to three other systematic enumeration techniques: generating trees, substitution decompositions, and the insertion encoding.
Enumeration
Cite
Citations (49)
Abstract Using properties of ${\cal K}$ -pairs of sets, we show that every nonzero enumeration degree a bounds a nontrivial initial segment of enumeration degrees whose nonzero elements have all the same jump as a . Some consequences of this fact are derived, that hold in the local structure of the enumeration degrees, including: There is an initial segment of enumeration degrees, whose nonzero elements are all high; there is a nonsplitting high enumeration degree; every noncappable enumeration degree is high; every nonzero low enumeration degree can be capped by degrees of any possible local jump (i.e., any jump that can be realized by enumeration degrees of the local structure); every enumeration degree that bounds a nonzero element of strictly smaller jump, is bounding; every low enumeration degree below a non low enumeration degree a can be capped below a .
Enumeration
Degree (music)
Bounding overwatch
Cite
Citations (5)
Enumeration
Cite
Citations (1)
Enumeration
Cite
Citations (0)
Enumeration
Sigma
Degree (music)
Sequence (biology)
Cite
Citations (1)
Graph-theoretical concepts and definitions molecular codes enumeration and isomeric acyclic structures enumeration of polyhex systems enumeration of carcinogenic bay regions enumeration of aza-polygexes enumeration of Kekule Valence structures enumeration of 2-factors of planar polyhexes graph-theoretical indices the ID number.
Enumeration
Cite
Citations (42)
In this paper, we enumerate enumeration problems and algorithms. This survey is under construction. If you know some results not in this survey or there is anything wrong, please let me know.
Enumeration
Cite
Citations (21)
We exhibit finite injury constructions of a high Σ02 enumeration degree incomparable with all intermediate Δ02 enumeration degrees, as also of both an upwards properly Σ02 high and a low non-cuppable Σ02 enumeration degree.We also outline how to apply the same methods to prove that, for every Σ02 enumeration degree b there exists a non-cuppable degree a such that b' ≤a' and a" ≤ b", thus showing that there exist non-cuppable Σ02 enumeration degrees at every possible level of the high/low jump hierarchy.
Enumeration
Degree (music)
Cite
Citations (4)
Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package WILFPLUS, which implements this process. We also compare enumeration schemes to three other systematic enumeration techniques: generating trees, substitution decompositions, and the insertion encoding.
Enumeration
Cite
Citations (3)