Leon Anavy

Leon Anavy

Auto-generated profile, based on publicly available information

Leon Anavy

School of Computer Science, Reichman University, Herzliya, Israel

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 April 2016 in Genome Biology
Verified
Journal Article
Open access
PDF file
THTamar Hashimshony
Tamar Hashimshony
NSNaftalie Senderovich
Naftalie Senderovich
GAGal Avital
Gal Avital
AKAgnes Klochendler
Agnes Klochendler
YLYaron de Leeuw
Yaron de Leeuw
IYItai Yanai
Itai Yanai
Single-cell transcriptomics requires a method that is sensitive, accurate, and reproducible. Here, we present CEL-Seq2, a modified version of our CEL-Seq method, with threefold higher sensitivity, lower costs, and less hands-on time. We implemented CEL-Seq2 on Fluidigm’s C1 system, providing its first single-cell, on-chip barcoding method, and we detected gene expression changes accompanying the progression through the cell cycle in mouse fibroblast cells. We also compare with Smart-Seq to demonstrate CEL-Seq2’s increased sensitivity relative to other available methods. Collectively, the improvements make CEL-Seq2 uniquely suited to single-cell RNA-Seq analysis in terms of economics, resolution, and ease of use.

17 February 2016 in Nature
Verified
Journal Article
Closed access
PDF file
MLMichal Levin
Michal Levin
LALeon Anavy
Leon Anavy
ACAlison G. Cole
Alison G. Cole
EWEitan Winter
Eitan Winter
NMNatalia Mostov
Natalia Mostov
IYItai Yanai
Itai Yanai

9 September 2019 in Nature Biotechnology
Verified
Journal Article
Closed access
PDF file
LALeon Anavy
Leon Anavy
IVInbal Vaknin
Inbal Vaknin
OAOrna Atar
Orna Atar
RARoee Amit
Roee Amit
ZYZohar Yakhini
Zohar Yakhini

1 March 2014 in Development
Verified
Journal Article
Closed access
PDF file
LALeon Anavy
Leon Anavy
MLMichal Levin
Michal Levin
SKSally Khair
Sally Khair
NNNagayasu Nakanishi
Nagayasu Nakanishi
SFSelene L. Fernandez-Valverde
Selene L. Fernandez-Valverde
IYItai Yanai
Itai Yanai
RNA-Seq enables the efficient transcriptome sequencing of many samples from small amounts of material, but the analysis of these data remains challenging. In particular, in developmental studies, RNA-Seq is challenged by the morphological staging of samples, such as embryos, since these often lack clear markers at any particular stage. In such cases, the automatic identification of the stage of a sample would enable previously infeasible experimental designs. Here we present the ‘basic linear index determination of transcriptomes’ (BLIND) method for ordering samples comprising different developmental stages. The method is an implementation of a traveling salesman algorithm to order the transcriptomes according to their inter-relationships as defined by principal components analysis. To establish the direction of the ordered samples, we show that an appropriate indicator is the entropy of transcriptomic gene expression levels, which increases over developmental time. Using BLIND, we correctly recover the annotated order of previously published embryonic transcriptomic timecourses for frog, mosquito, fly and zebrafish. We further demonstrate the efficacy of BLIND by collecting 59 embryos of the sponge Amphimedon queenslandica and ordering their transcriptomes according to developmental stage. BLIND is thus useful in establishing the temporal order of samples within large datasets and is of particular relevance to the study of organisms with asynchronous development and when morphological staging is difficult.

25 August 2020 in Bioinformatics
Verified
Journal Article
Closed access
OSOmer Sabary
Omer Sabary
YOYoav Orlev
Yoav Orlev
RSRoy Shafir
Roy Shafir
LALeon Anavy
Leon Anavy
EYEitan Yaakobi
Eitan Yaakobi
ZYZohar Yakhini
Zohar Yakhini
Motivation: Recent years have seen a growing number and an expanding scope of studies using synthetic oligo libraries for a range of applications in synthetic biology. As experiments are growing by numbers and complexity, analysis tools can facilitate quality control and support better assessment and inference. Results: We present a novel analysis tool, called SOLQC, which enables fast and comprehensive analysis of synthetic oligo libraries, based on NGS analysis performed by the user. SOLQC provides statistical information such as the distribution of variant representation, different error rates and their dependence on sequence or library properties. SOLQC produces graphical reports from the analysis, in a flexible format. We demonstrate SOLQC by analyzing literature libraries. We also discuss the potential benefits and relevance of the different components of the analysis. Availability and implementation: SOLQC is a free software for non-commercial use, available at https://app.gitbook.com/@yoav-orlev/s/solqc/. For commercial use please contact the authors. Supplementary information: Supplementary data are available at Bioinformatics online.

31 May 2024 in IEEE Transactions on Molecular, Biological, and Multi-Scale Communications
Verified
Journal Article
Open access
IPInbal Preuss
Inbal Preuss
BGBen Galili
Ben Galili
ZYZohar Yakhini
Zohar Yakhini
LALeon Anavy
Leon Anavy
This study introduces a novel model for analyzing and determining the required sequencing coverage in DNA-based data storage, focusing on combinatorial DNA encoding. We seek to characterize the distribution of the number of sequencing reads required for message reconstruction. We use a variant of the coupon collector distribution for this purpose. For any given number of observed reads, R ϵ N, we use a Markov Chain representation of the process to compute the probability of error-free reconstruction. We develop theoretical bounds on the decoding probability and use empirical simulations to validate these bounds and assess tightness. This work contributes to understanding sequencing coverage in DNA-based data storage, offering insights into decoding complexity, error correction, and sequence reconstruction. We provide a Python package, with its input being the code design and other message parameters, all of which are denoted as Θ, and a desired confidence level 1-δ. This package computes the required read coverage, guaranteeing the message reconstruction R=R(δ,Θ).