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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aryan Arbabi

dblp:120/1806 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2019
0000-0002-0440-9087ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

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
3 papers
Bioinformatics and computational biology · 52% Medical and health informatics · 48%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › cancer genomics › copy number analysis
copy number variation detection
0.422016
Cell-free DNA fragment-size distribution analysis for non-invasive prenatal CNV prediction · Bioinform. 2016
Probabilistic method for detecting copy number variation in a fetal genome using maternal plasma sequencing · Bioinform. 2014
Medical and health informatics › clinical genomics
non-invasive prenatal testing
0.422016
Cell-free DNA fragment-size distribution analysis for non-invasive prenatal CNV prediction · Bioinform. 2016
Probabilistic method for detecting copy number variation in a fetal genome using maternal plasma sequencing · Bioinform. 2014
Natural language and speech › Information extraction and text analysis
named entity recognition
0.412019
Identifying Clinical Terms in Free-Text Notes Using Ontology-Guided Machine Learning · RECOMB 2019
Medical and health informatics
clinical text processing
0.412019
Identifying Clinical Terms in Free-Text Notes Using Ontology-Guided Machine Learning · RECOMB 2019
Bioinformatics and computational biology › genomics › genomic data analysis
cell-free DNA analysis
0.212016
Cell-free DNA fragment-size distribution analysis for non-invasive prenatal CNV prediction · Bioinform. 2016

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

ontology-guided machine learning · 0.8fragment-size distribution analysis · 0.2probabilistic modeling · 0.2hidden markov model · 0.2
YearPublicationVenuePosition
2019 Identifying Clinical Terms in Free-Text Notes Using Ontology-Guided Machine Learning
Aryan Arbabi, David R. Adams, Sanja Fidler, Michael Brudno
RECOMB1
2016 Cell-free DNA fragment-size distribution analysis for non-invasive prenatal CNV prediction
abstract
BACKGROUND: Non-invasive detection of aneuploidies in a fetal genome through analysis of cell-free DNA circulating in the maternal plasma is becoming a routine clinical test. Such tests, which rely on analyzing the read coverage or the allelic ratios at single-nucleotide polymorphism (SNP) loci, are not sensitive enough for smaller sub-chromosomal abnormalities due to sequencing biases and paucity of SNPs in a genome. RESULTS: We have developed an alternative framework for identifying sub-chromosomal copy number variations in a fetal genome. This framework relies on the size distribution of fragments in a sample, as fetal-origin fragments tend to be smaller than those of maternal origin. By analyzing the local distribution of the cell-free DNA fragment sizes in each region, our method allows for the identification of sub-megabase CNVs, even in the absence of SNP positions. To evaluate the accuracy of our method, we used a plasma sample with the fetal fraction of 13%, down-sampled it to samples with coverage of 10X-40X and simulated samples with CNVs based on it. Our method had a perfect accuracy (both specificity and sensitivity) for detecting 5 Mb CNVs, and after reducing the fetal fraction (to 11%, 9% and 7%), it could correctly identify 98.82-100% of the 5 Mb CNVs and had a true-negative rate of 95.29-99.76%. AVAILABILITY AND IMPLEMENTATION: Our source code is available on GitHub at https://github.com/compbio-UofT/FSDA CONTACT: : [email protected].
Aryan Arbabi, Ladislav Rampásek, Michael Brudno
Bioinform.1
2014 Probabilistic method for detecting copy number variation in a fetal genome using maternal plasma sequencing
abstract
MOTIVATION: The past several years have seen the development of methodologies to identify genomic variation within a fetus through the non-invasive sequencing of maternal blood plasma. These methods are based on the observation that maternal plasma contains a fraction of DNA (typically 5-15%) originating from the fetus, and such methodologies have already been used for the detection of whole-chromosome events (aneuploidies), and to a more limited extent for smaller (typically several megabases long) copy number variants (CNVs). RESULTS: Here we present a probabilistic method for non-invasive analysis of de novo CNVs in fetal genome based on maternal plasma sequencing. Our novel method combines three types of information within a unified Hidden Markov Model: the imbalance of allelic ratios at SNP positions, the use of parental genotypes to phase nearby SNPs and depth of coverage to better differentiate between various types of CNVs and improve precision. Our simulation results, based on in silico introduction of novel CNVs into plasma samples with 13% fetal DNA concentration, demonstrate a sensitivity of 90% for CNVs >400 kb (with 13 calls in an unaffected genome), and 40% for 50-400 kb CNVs (with 108 calls in an unaffected genome). AVAILABILITY AND IMPLEMENTATION: Implementation of our model and data simulation method is available at http://github.com/compbio-UofT/fCNV.
Ladislav Rampásek, Aryan Arbabi, Michael Brudno
Bioinform.2
2014 ARYANA: Aligning Reads by Yet Another Approach
abstract
MOTIVATION: Although there are many different algorithms and software tools for aligning sequencing reads, fast gapped sequence search is far from solved. Strong interest in fast alignment is best reflected in the $10(6) prize for the Innocentive competition on aligning a collection of reads to a given database of reference genomes. In addition, de novo assembly of next-generation sequencing long reads requires fast overlap-layout-concensus algorithms which depend on fast and accurate alignment. CONTRIBUTION: We introduce ARYANA, a fast gapped read aligner, developed on the base of BWA indexing infrastructure with a completely new alignment engine that makes it significantly faster than three other aligners: Bowtie2, BWA and SeqAlto, with comparable generality and accuracy. Instead of the time-consuming backtracking procedures for handling mismatches, ARYANA comes with the seed-and-extend algorithmic framework and a significantly improved efficiency by integrating novel algorithmic techniques including dynamic seed selection, bidirectional seed extension, reset-free hash tables, and gap-filling dynamic programming. As the read length increases ARYANA's superiority in terms of speed and alignment rate becomes more evident. This is in perfect harmony with the read length trend as the sequencing technologies evolve. The algorithmic platform of ARYANA makes it easy to develop mission-specific aligners for other applications using ARYANA engine. AVAILABILITY: ARYANA with complete source code can be obtained from http://github.com/aryana-aligner.
Milad Gholami, Aryan Arbabi, Ali Sharifi-Zarchi, Hamidreza Chitsaz, Mehdi Sadeghi
BMC Bioinform.2
2012 Fast CPU-based DNA exact sequence aligner
abstract
Fast alignment of small sequences to a very large sequence has recently been under attention of many researchers, due to the applications in processing the biological sequences and specially mapping the short reads of Next Generation Sequencing to an already assembled reference genome. The MEMOCODE 2012 contest was aimed to design a very efficient exact DNA sequence matching method to map a huge number of short subsequences of the human genome and to optimize the performance of design: the running time and the cost of the required hardware platform. We designed and implemented two separate solutions, one based on Burrows Wheeler Transform (BWT) with some optimizations to the algorithm that improve its speed significantly, the other one which won the normalized section of the contest uses a hash indexing method.
Aryan Arbabi, Milad Gholami, Mojtaba Varmazyar, Shervin Daneshpajouh
MEMOCODE1