Mike Mikailov

Mike Mikailov

Auto-generated profile, based on publicly available information

Mike Mikailov

U.S. Food and Drug Administration, Silver Spring, MD, USA

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
25 April 2018 in mSphere
Verified
Journal Article
Open access
PDF file
NGNorman Goodacre
Norman Goodacre
AAAisha Aljanahi
Aisha Aljanahi
SNSubhiksha Nandakumar
Subhiksha Nandakumar
MMMike Mikailov
Mike Mikailov
AKArifa Khan
Arifa Khan
To facilitate bioinformatics analysis of high-throughput sequencing (HTS) data for the detection of both known and novel viruses, we have developed a new reference viral database (RVDB) that provides a broad representation of different virus species from eukaryotes by including all viral, virus-like, and virus-related sequences (excluding bacteriophages), regardless of their size. In particular, RVDB contains endogenous nonretroviral elements, endogenous retroviruses, and retrotransposons. Sequences were clustered to reduce redundancy while retaining high viral sequence diversity. A particularly useful feature of RVDB is the reduction of cellular sequences, which can enhance the run efficiency of large transcriptomic and genomic data analysis and increase the specificity of virus detection.

10 May 2011 in Nucleic Acids Research
Verified
Journal Article
Open access
PDF file
HLHeng Luo
Heng Luo
JCJian Chen
Jian Chen
LSLeming Shi
Leming Shi
MMMike Mikailov
Mike Mikailov
HZHuang Zhu
Huang Zhu
LYLun Yang
Lun Yang
Identifying new indications for existing drugs (drug repositioning) is an efficient way of maximizing their potential. Adverse drug reaction (ADR) is one of the leading causes of death among hospitalized patients. As both new indications and ADRs are caused by unexpected chemical–protein interactions on off-targets, it is reasonable to predict these interactions by mining the chemical–protein interactome (CPI). Making such predictions has recently been facilitated by a web server named DRAR-CPI. This server has a representative collection of drug molecules and targetable human proteins built up from our work in drug repositioning and ADR. When a user submits a molecule, the server will give the positive or negative association scores between the user’s molecule and our library drugs based on their interaction profiles towards the targets. Users can thus predict the indications or ADRs of their molecule based on the association scores towards our library drugs. We have matched our predictions of drug–drug associations with those predicted via gene-expression profiles, achieving a matching rate as high as 74%. We have also successfully predicted the connections between anti-psychotics and anti-infectives, indicating the underlying relevance of anti-psychotics in the potential treatment of infections, vice versa. This server is freely available at http://cpi.bio-x.cn/drar/ .

1 January 2019 in Drug Discovery Today
Verified
Journal Article
Closed access
ZWZhining Wen
Zhining Wen
YLYu Liang
Yu Liang
YHYingyi Hao
Yingyi Hao
BDBrian Delavan
Brian Delavan
RHRuili Huang
Ruili Huang
ZLZhichao Liu
Zhichao Liu

17 February 2023 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Open access
WLWeizhe Li
Weizhe Li
MMMike Mikailov
Mike Mikailov
WCWeijie Chen
Weijie Chen
Digital pathology whole-slide images (WSIs) are large-size gigapixel images and image analysis based on deep learning artificial intelligence (AI) technology often involves pixel-wise testing of a trained deep learning neural network (DLNN) on hundreds of WSI images, which is time consuming. We take advantage of High-Performance Computing (HPC) facilities to parallelize this procedure into multiple independent (and hence delightfully parallel) tasks. However, traditional software parallelization techniques and regular file formats can have significant scaling problems on HPC clusters. In this work, a useful computational strategy is designed to localize and extract relevant patches in WSI files and group them in HDF5 files well suited for parallel I/O. HPC's array job facilities are adapted for hierarchical scaling and parallelization of WSI pre-processing and testing of trained algorithms. Applying these techniques to testing a trained DLNN on the CAMELYON datasets with 399 WSIs reduced the theoretical processing time of 18 years on a single CPU or 30 days on a single GPU to less than 45 hours on an HPC cluster of 4,000 CPU cores. The efficiency-accuracy trade-off we demonstrated on this dataset further reinforced the importance of efficient computation techniques, without which the accuracy may be sacrificed. The framework developed here for testing DLNNs does not rely on any specific neural network architecture and HPC cluster setup and can be utilized for any large-scale image processing and big-data analysis.

28 December 2017 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
MMMike Mikailov
Mike Mikailov
FLFu-Jyh Luo
Fu-Jyh Luo
SBStuart Barkley
Stuart Barkley
LVLohit Valleru
Lohit Valleru
SWStephen Whitney
Stephen Whitney
NPNicholas Petrick
Nicholas Petrick
Recent breakthroughs in molecular biology and next generation sequencing technologies have led to the expenential growh of the sequence databases. Researchrs use BLAST for processing these sequences. However traditional software parallelization techniques (threads, message passing interface) applied in newer versios of BLAST are not adequate for processing these sequences in timely manner. A new method for array job parallelization has been developed which offers O(T) theoretical speed-up in comparison to multi-threading and MPI techniques. Here T is the number of array job tasks. (The number of CPUs that will be used to complete the job equals the product of T multiplied by the number of CPUs used by a single task.) The approach is based on segmentation of both input datasets to the BLAST process, combining partial solutions published earlier (Dhanker and Gupta, Int J Comput Sci Inf Technol_5:4818-4820, 2014), (Grant et al., Bioinformatics_18:765-766, 2002), (Mathog, Bioinformatics_19:1865-1866, 2003). It is accordingly referred to as a “dual segmentation” method. In order to implement the new method, the BLAST source code was modified to allow the researcher to pass to the program the number of records (effective number of sequences) in the original database. The team also developed methods to manage and consolidate the large number of partial results that get produced. Dual segmentation allows for massive parallelization, which lifts the scaling ceiling in exciting ways. BLAST jobs that hitherto failed or slogged inefficiently to completion now finish with speeds that characteristically reduce wallclock time from 27 days on 40 CPUs to a single day using 4104 tasks, each task utilizing eight CPUs and taking less than 7 minutes to complete. The massive increase in the number of tasks when running an analysis job with dual segmentation reduces the size, scope and execution time of each task. Besides significant speed of completion, additional benefits include fine-grained checkpointing and increased flexibility of job submission. “Trickling in” a swarm of individual small tasks tempers competition for CPU time in the shared HPC environment, and jobs submitted during quiet periods can complete in extraordinarily short time frames. The smaller task size also allows the use of older and less powerful hardware. The CDRH workhorse cluster was commissioned in 2010, yet its eight-core CPUs with only 24GB RAM work well in 2017 for these dual segmentation jobs. Finally, these techniques are excitingly friendly to budget conscious scientific research organizations where probabilistic algorithms such as BLAST might discourage attempts at greater certainty because single runs represent a major resource drain. If a job that used to take 24 days can now be completed in less than an hour or on a space available basis (which is the case at CDRH), repeated runs for more exhaustive analyses can be usefully contemplated.

16 December 2022 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
TCTrinity Cheng
Trinity Cheng
PCPei-Ju Chin
Pei-Ju Chin
KCKenny H. Cha
Kenny H. Cha
NPNicholas Petrick
Nicholas Petrick
MMMike Mikailov
Mike Mikailov
Background: The Basic Local Alignment Search Tool (BLAST) is a suite of commonly used algorithms for identifying matches between biological sequences. The user supplies a database file and query file of sequences for BLAST to find identical sequences between the two. The typical millions of database and query sequences make BLAST computationally challenging but also well suited for parallelization on high-performance computing clusters. The efficacy of parallelization depends on the data partitioning, where the optimal data partitioning relies on an accurate performance model. In previous studies, a BLAST job was sped up by 27 times by partitioning the database and query among thousands of processor nodes. However, the optimality of the partitioning method was not studied. Unlike BLAST performance models proposed in the literature that usually have problem size and hardware configuration as the only variables, the execution time of a BLAST job is a function of database size, query size, and hardware capability. In this work, the nucleotide BLAST application BLASTN was profiled using three methods: shell-level profiling with the Unix “time” command, code-level profiling with the built-in “profiler” module, and system-level profiling with the Unix “gprof” program. The runtimes were measured for six node types, using six different database files and 15 query files, on a heterogeneous HPC cluster with 500+ nodes. The empirical measurement data were fitted with quadratic functions to develop performance models that were used to guide the data parallelization for BLASTN jobs. Results: Profiling results showed that BLASTN contains more than 34,500 different functions, but a single function, RunMTBySplitDB, takes 99.12% of the total runtime. Among its 53 child functions, five core functions were identified to make up 92.12% of the overall BLASTN runtime. Based on the performance models, static load balancing algorithms can be applied to the BLASTN input data to minimize the runtime of the longest job on an HPC cluster. Four test cases being run on homogeneous and heterogeneous clusters were tested. Experiment results showed that the runtime can be reduced by 81% on a homogeneous cluster and by 20% on a heterogeneous cluster by re-distributing the workload. Discussion: Optimal data partitioning can improve BLASTN’s overall runtime 5.4-fold in comparison with dividing the database and query into the same number of fragments. The proposed methodology can be used in the other applications in the BLAST+ suite or any other application as long as source code is available.