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

Minh Duc Cao

dblp:29/2211 · DBLP profile ↗
← Back
12ranked-venue papers
6as first author
2since 2021 · last 2024
0000-0003-4079-2383ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 9 · 4 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-authorArtificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
sequence analysis
0.312018
Simulating the dynamics of targeted capture sequencing with CapSim · Bioinform. 2018
Bioinformatics and computational biology › sequence analysis
sequencing data analysis
0.312017
Real-time demultiplexing Nanopore barcoded sequencing data with npBarcode · Bioinform. 2017
Bioinformatics and computational biology › sequence analysis
nanopore sequencing
0.212016
Realtime analysis and visualization of MinION sequencing data with npReader · Bioinform. 2016
Bioinformatics and computational biology › sequence analysis › nanopore sequencing
real-time sequencing analysis
0.212016
Realtime analysis and visualization of MinION sequencing data with npReader · Bioinform. 2016
Bioinformatics and computational biology › biological data visualization
sequencing data visualization
0.112016
Realtime analysis and visualization of MinION sequencing data with npReader · Bioinform. 2016

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

sequencing read simulation · 0.3hybridization dynamics simulation · 0.3streaming algorithm · 0.3streaming analysis · 0.2
YearPublicationVenuePosition
2024 AMRViz enables seamless genomics analysis and visualization of antimicrobial resistance
abstract
We have developed AMRViz, a toolkit for analyzing, visualizing, and managing bacterial genomics samples. The toolkit is bundled with the current best practice analysis pipeline allowing researchers to perform comprehensive analysis of a collection of samples directly from raw sequencing data with a single command line. The analysis results in a report showing the genome structure, genome annotations, antibiotic resistance and virulence profile for each sample. The pan-genome of all samples of the collection is analyzed to identify core- and accessory-genes. Phylogenies of the whole genome as well as all gene clusters are also generated. The toolkit provides a web-based visualization dashboard allowing researchers to interactively examine various aspects of the analysis results. Availability: AMRViz is implemented in Python and NodeJS, and is publicly available under open source MIT license at https://github.com/amromics/amrviz .
Duc Quang Le, Son Hoang Nguyen, Tam Thi Nguyen, Canh Hao Nguyen, Tho Huu Ho, Nam Sy Vo, Hoang Anh Nguyen, Minh Duc Cao
BMC Bioinform.9
2021 Real-time resolution of short-read assembly graph using ONT long reads
abstract
A streaming assembly pipeline utilising real-time Oxford Nanopore Technology (ONT) sequencing data is important for saving sequencing resources and reducing time-to-result. A previous approach implemented in npScarf provided an efficient streaming algorithm for hybrid assembly but was relatively prone to mis-assemblies compared to other graph-based methods. Here we present npGraph, a streaming hybrid assembly tool using the assembly graph instead of the separated pre-assembly contigs. It is able to produce more complete genome assembly by resolving the path finding problem on the assembly graph using long reads as the traversing guide. Application to synthetic and real data from bacterial isolate genomes show improved accuracy while still maintaining a low computational cost. npGraph also provides a graphical user interface (GUI) which provides a real-time visualisation of the progress of assembly. The tool and source code is available at https://github.com/hsnguyen/assembly.
Son Hoang Nguyen, Minh Duc Cao, Lachlan James M. Coin
PLoS Comput. Biol.2
2018 Simulating the dynamics of targeted capture sequencing with CapSim
abstract
Motivation: Targeted sequencing using capture probes has become increasingly popular in clinical applications due to its scalability and cost-effectiveness. The approach also allows for higher sequencing coverage of the targeted regions resulting in better analysis statistical power. However, because of the dynamics of the hybridization process, it is difficult to evaluate the efficiency of the probe design prior to the experiments which are time consuming and costly. Results: We developed CapSim, a software package for simulation of targeted sequencing. Given a genome sequence and a set of probes, CapSim simulates the fragmentation, the dynamics of probe hybridization and the sequencing of the captured fragments on Illumina and PacBio sequencing platforms. The simulated data can be used for evaluating the performance of the analysis pipeline, as well as the efficiency of the probe design. Parameters of the various stages in the sequencing process can also be evaluated in order to optimize the experiments. Availability and implementation: CapSim is publicly available under BSD license at https://github.com/Devika1/capsim. Contact: [email protected]. Supplementary information: Supplementary data are available at Bioinformatics online.
Minh Duc Cao, Devika Ganesamoorthy, Lachlan James M. Coin
Bioinform.1
2018 GtTR: Bayesian estimation of absolute tandem repeat copy number using sequence capture and high throughput sequencing
abstract
BACKGROUND: Tandem repeats comprise significant proportion of the human genome including coding and regulatory regions. They are highly prone to repeat number variation and nucleotide mutation due to their repetitive and unstable nature, making them a major source of genomic variation between individuals. Despite recent advances in high throughput sequencing, analysis of tandem repeats in the context of complex diseases is still hindered by technical limitations. We report a novel targeted sequencing approach, which allows simultaneous analysis of hundreds of repeats. We developed a Bayesian algorithm, namely - GtTR - which combines information from a reference long-read dataset with a short read counting approach to genotype tandem repeats at population scale. PCR sizing analysis was used for validation. RESULTS: We used a PacBio long-read sequenced sample to generate a reference tandem repeat genotype dataset with on average 13% absolute deviation from PCR sizing results. Using this reference dataset GtTR generated estimates of VNTR copy number with accuracy within 95% high posterior density (HPD) intervals of 68 and 83% for capture sequence data and 200X WGS data respectively, improving to 87 and 94% with use of a PCR reference. We show that the genotype resolution increases as a function of depth, such that the median 95% HPD interval lies within 25, 14, 12 and 8% of the its midpoint copy number value for 30X, 200X WGS, 395X and 800X capture sequence data respectively. We validated nine targets by PCR sizing analysis and genotype estimates from sequencing results correlated well with PCR results. CONCLUSIONS: The novel genotyping approach described here presents a new cost-effective method to explore previously unrecognized class of repeat variation in GWAS studies of complex diseases at the population level. Further improvements in accuracy can be obtained by improving accuracy of the reference dataset.
Devika Ganesamoorthy, Minh Duc Cao, Tania P. S. Duarte, Lachlan James M. Coin
BMC Bioinform.2
2018 npInv: accurate detection and genotyping of inversions using long read sub-alignment
abstract
BACKGROUND: Detection of genomic inversions remains challenging. Many existing methods primarily target inzversions with a non repetitive breakpoint, leaving inverted repeat (IR) mediated non-allelic homologous recombination (NAHR) inversions largely unexplored. RESULT: We present npInv, a novel tool specifically for detecting and genotyping NAHR inversion using long read sub-alignment of long read sequencing data. We benchmark npInv with other tools in both simulation and real data. We use npInv to generate a whole-genome inversion map for NA12878 consisting of 30 NAHR inversions (of which 15 are novel), including all previously known NAHR mediated inversions in NA12878 with flanking IR less than 7kb. Our genotyping accuracy on this dataset was 94%. We used PCR to confirm the presence of two of these novel inversions. We show that there is a near linear relationship between the length of flanking IR and the minimum inversion size, without inverted repeats. CONCLUSION: The application of npInv shows high accuracy in both simulation and real data. The results give deeper insight into understanding inversion.
Haojing Shao, Devika Ganesamoorthy, Tania P. S. Duarte, Minh Duc Cao, Clive J. Hoggart, Lachlan James M. Coin
BMC Bioinform.4
2017 Real-time demultiplexing Nanopore barcoded sequencing data with npBarcode
abstract
MOTIVATION: The recent introduction of a barcoding protocol for Oxford Nanopore sequencing has increased the versatility of the technology. Several bioinformatics tools have been developed to demultiplex barcoded reads, but none of them supports streaming analysis. This limits the use of multiplexed sequencing in real-time applications, which is one of the main advantages of the technology. RESULTS: We introduced npBarcode, an open source and cross-platform tool for barcode demultiplexing in streaming fashion that can be used to pipe data to further real-time analyses. The tool also provides a friendly graphical user interface by integrating the module into npReader, making possible to monitor the progress concurrently when the sequencing is still in progress. We show that our algorithm achieves accuracies at least as good as competing tools. AVAILABILITY AND IMPLEMENTATION: npBarcode is bundled in Japsa-a Java tools kit for genome analysis, and is freely available at https://github.com/mdcao/japsa. CONTACT: [email protected] or [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Son Hoang Nguyen, Tania P. S. Duarte, Lachlan James M. Coin, Minh Duc Cao
Bioinform.4
2016 Realtime analysis and visualization of MinION sequencing data with npReader
abstract
MOTIVATION: The recently released Oxford Nanopore MinION sequencing platform presents many innovative features opening up potential for a range of applications not previously possible. Among these features, the ability to sequence in real-time provides a unique opportunity for many time-critical applications. While many software packages have been developed to analyze its data, there is still a lack of toolkits that support the streaming and real-time analysis of MinION sequencing data. RESULTS: We developed npReader, an open-source software package to facilitate real-time analysis of MinION sequencing data. npReader can simultaneously extract sequence reads and stream them to downstream analysis pipelines while the samples are being sequenced on the MinION device. It provides a command line interface for easy integration into a bioinformatics work flow, as well as a graphical user interface which concurrently displays the statistics of the run. It also provides an application programming interface for development of streaming algorithms in order to fully utilize the extent of nanopore sequencing potential. AVAILABILITY AND IMPLEMENTATION: npReader is written in Java and is freely available at https://github.com/mdcao/npReader CONTACT: [email protected] or [email protected].
Minh Duc Cao, Devika Ganesamoorthy, Matthew A. Cooper, Lachlan James M. Coin
Bioinform.1
2015 Sequencing technologies and tools for short tandem repeat variation detection
abstract
Short tandem repeats are highly polymorphic and associated with a wide range of phenotypic variation, some of which cause neurodegenerative disease in humans. With advances in high-throughput sequencing technologies, there are novel opportunities to study genetic variation. While available sequencing technologies and bioinformatics tools provide options for mining high-throughput sequencing data, their suitability for analysis of repeat variation is an open question, with tools for quantifying variability in repetitive sequence still in their infancy. We present here a comprehensive survey and empirical evaluation of current sequencing technologies and bioinformatics tools in all stages of an analysis pipeline. While there is not one optimal pipeline to suit all circumstances, we find that the choice of alignment and repeat genotyping tools greatly impacts the accuracy and efficiency by which short tandem repeat variation can be detected. We further note that to detect variation relevant to many repeat diseases, it is essential to choose technologies that offer either long read-lengths or paired-end sequencing, coupled with specific genotyping tools.
Minh Duc Cao, Sureshkumar Balasubramanian, Mikael Bodén
Briefings Bioinform.1
2010 A genome alignment algorithm based on compression
abstract
BACKGROUND: Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of the two sequences. They are often computationally expensive and unable to deal with low information regions. Furthermore, they lack a well-principled objective function to measure the performance of sets of parameters. Since genomic sequences carry genetic information, this article proposes that the information content of each nucleotide in a position should be considered in sequence alignment. An information-theoretic approach for pairwise genome local alignment, namely XMAligner, is presented. Instead of comparing sequences at the character level, XMAligner considers a pair of nucleotides from two sequences to be related if their mutual information in context is significant. The information content of nucleotides in sequences is measured by a lossless compression technique. RESULTS: Experiments on both simulated data and real data show that XMAligner is superior to conventional methods especially on distantly related sequences and statistically biased data. XMAligner can align sequences of eukaryote genome size with only a modest hardware requirement. Importantly, the method has an objective function which can obviate the need to choose parameter values for high quality alignment. The alignment results from XMAligner can be integrated into a visualisation tool for viewing purpose. CONCLUSIONS: The information-theoretic approach for sequence alignment is shown to overcome the mentioned problems of conventional character matching alignment methods. The article shows that, as genomic sequences are meant to carry information, considering the information content of nucleotides is helpful for genomic sequence alignment. AVAILABILITY: Downloadable binaries, documentation and data can be found at ftp://ftp.infotech.monash.edu.au/software/DNAcompress-XM/XMAligner/.
Minh Duc Cao, Trevor I. Dix, Lloyd Allison
BMC Bioinform.1
2009 Computing Substitution Matrices for Genomic Comparative Analysis
Minh Duc Cao, Trevor I. Dix, Lloyd Allison
PAKDD1
2007 A Simple Statistical Algorithm for Biological Sequence Compression
abstract
This paper introduces a novel algorithm for biological sequence compression that makes use of both statistical properties and repetition within sequences. A panel of experts is maintained to estimate the probability distribution of the next symbol in the sequence to be encoded. Expert probabilities are combined to obtain the final distribution. The resulting information sequence provides insight for further study of the biological sequence. Each symbol is then encoded by arithmetic coding. Experiments show that our algorithm outperforms existing compressors on typical DNA and protein sequence datasets while maintaining a practical running time.
Minh Duc Cao, Trevor I. Dix, Lloyd Allison, Chris Mears
DCC1
2006 Modelling Citation Networks for Improving Scientific Paper Classification Performance
Mengjie Zhang 0001, Xiaoying Gao, Minh Duc Cao, Yuejin Ma
PRICAI3