Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Liran I. Shlush

dblp:155/2469 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0002-3700-270XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genomics
next-generation sequencing data analysis
0.612022
SmMIP-tools: a computational toolset for processing and analysis of single-molecule molecular inversion probes-derived data · Bioinform. 2022
Bioinformatics and computational biology › sequence analysis
mutation detection
0.212022
SmMIP-tools: a computational toolset for processing and analysis of single-molecule molecular inversion probes-derived data · Bioinform. 2022

Methods — techniques the papers use, named apart from their topics

variant calling · 0.6
YearPublicationVenuePosition
2022 SmMIP-tools: a computational toolset for processing and analysis of single-molecule molecular inversion probes-derived data
abstract
MOTIVATION: Single-molecule molecular inversion probes (smMIPs) provide an exceptionally cost-effective and modular approach for routine or large-cohort next-generation sequencing. However, processing the derived raw data to generate highly accurate variants calls remains challenging. RESULTS: We introduce SmMIP-tools, a comprehensive computational method that promotes the detection of single nucleotide variants and short insertions and deletions from smMIP-based sequencing. Our approach delivered near-perfect performance when benchmarked against a set of known mutations in controlled experiments involving DNA dilutions and outperformed other commonly used computational methods for mutation detection. Comparison against clinically approved diagnostic testing of leukaemia patients demonstrated the ability to detect both previously reported variants and a set of pathogenic mutations that did not pass detection by clinical testing. Collectively, our results indicate that increased performance can be achieved when tailoring data processing and analysis to its related technology. The feasibility of using our method in research and clinical settings to benefit from low-cost smMIP technology is demonstrated. AVAILABILITY AND IMPLEMENTATION: The source code for SmMIP-tools, its manual and additional scripts aimed to foster large-scale data processing and analysis are all available on github (https://github.com/abelson-lab/smMIP-tools). Raw sequencing data generated in this study have been submitted to the European Genome-Phenome Archive (EGA; https://ega-archive.org) and can be accessed under accession number EGAS00001005359. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Jessie J. F. Medeiros, Jose-Mario Capo-Chichi, Liran I. Shlush, John E. Dick, Andrea Arruda, Mark D. Minden, Sagi Abelson
Bioinform.3
2013 Comparing Algorithms That Reconstruct Cell Lineage Trees Utilizing Information on Microsatellite Mutations
abstract
Organism cells proliferate and die to build, maintain, renew and repair it. The cellular history of an organism up to any point in time can be captured by a cell lineage tree in which vertices represent all organism cells, past and present, and directed edges represent progeny relations among them. The root represents the fertilized egg, and the leaves represent extant and dead cells. Somatic mutations accumulated during cell division endow each organism cell with a genomic signature that is unique with a very high probability. Distances between such genomic signatures can be used to reconstruct an organism's cell lineage tree. Cell populations possess unique features that are absent or rare in organism populations (e.g., the presence of stem cells and a small number of generations since the zygote) and do not undergo sexual reproduction, hence the reconstruction of cell lineage trees calls for careful examination and adaptation of the standard tools of population genetics. Our lab developed a method for reconstructing cell lineage trees by examining only mutations in highly variable microsatellite loci (MS, also called short tandem repeats, STR). In this study we use experimental data on somatic mutations in MS of individual cells in human and mice in order to validate and quantify the utility of known lineage tree reconstruction algorithms in this context. We employed extensive measurements of somatic mutations in individual cells which were isolated from healthy and diseased tissues of mice and humans. The validation was done by analyzing the ability to infer known and clear biological scenarios. In general, we found that if the biological scenario is simple, almost all algorithms tested can infer it. Another somewhat surprising conclusion is that the best algorithm among those tested is Neighbor Joining where the distance measure used is normalized absolute distance. We include our full dataset in Tables S1, S2, S3, S4, S5 to enable further analysis of this data by others.
Noa Chapal-Ilani, Yosef E. Maruvka, Adam Spiro, Yitzhak Reizel, Rivka Adar, Liran I. Shlush, Ehud Shapiro
PLoS Comput. Biol.6