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.

David J. Burks

dblp:276/1163 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0003-0098-265XORCID · reported

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

Applied, interdisciplinary, general and emerging computing · 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
1 paper
Bioinformatics and computational biology · 62% Computational science and engineering · 38%

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

TopicWeightPapersLastEvidence papers
Computational science and engineering › graphical models
markov model-based classification
0.412020
Higher-order Markov models for metagenomic sequence classification · Bioinform. 2020
Bioinformatics and computational biology
metagenomics
0.412020
Higher-order Markov models for metagenomic sequence classification · Bioinform. 2020
Bioinformatics and computational biology › sequence analysis › sequence classification
alignment-free sequence classification
0.112020
Higher-order Markov models for metagenomic sequence classification · Bioinform. 2020
Bioinformatics and computational biology
sequence analysis
0.112020
Higher-order Markov models for metagenomic sequence classification · Bioinform. 2020

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

interpolated markov model · 0.4higher-order markov models · 0.4
YearPublicationVenuePosition
2020 Higher-order Markov models for metagenomic sequence classification
abstract
MOTIVATION: Alignment-free, stochastic models derived from k-mer distributions representing reference genome sequences have a rich history in the classification of DNA sequences. In particular, the variants of Markov models have previously been used extensively. Higher-order Markov models have been used with caution, perhaps sparingly, primarily because of the lack of enough training data and computational power. Advances in sequencing technology and computation have enabled exploitation of the predictive power of higher-order models. We, therefore, revisited higher-order Markov models and assessed their performance in classifying metagenomic sequences. RESULTS: Comparative assessment of higher-order models (HOMs, 9th order or higher) with interpolated Markov model, interpolated context model and lower-order models (8th order or lower) was performed on metagenomic datasets constructed using sequenced prokaryotic genomes. Our results show that HOMs outperform other models in classifying metagenomic fragments as short as 100 nt at all taxonomic ranks, and at lower ranks when the fragment size was increased to 250 nt. HOMs were also found to be significantly more accurate than local alignment which is widely relied upon for taxonomic classification of metagenomic sequences. A novel software implementation written in C++ performs classification faster than the existing Markovian metagenomic classifiers and can therefore be used as a standalone classifier or in conjunction with existing taxonomic classifiers for more robust classification of metagenomic sequences. AVAILABILITY AND IMPLEMENTATION: The software has been made available at https://github.com/djburks/SMM. CONTACT: [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
David J. Burks, Rajeev K. Azad
Bioinform.1