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

Isaac Turner

dblp:124/9448 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2018
0000-0002-2378-4886ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 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
2 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
genomics
0.522018
Integrating long-range connectivity information into de Bruijn graphs · Bioinform. 2018
High-throughput microbial population genomics using the Cortex variation assembler · Bioinform. 2013
Bioinformatics and computational biology › sequence analysis › sequence assembly
de bruijn graph
0.312018
Integrating long-range connectivity information into de Bruijn graphs · Bioinform. 2018
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly
0.312018
Integrating long-range connectivity information into de Bruijn graphs · Bioinform. 2018
Bioinformatics and computational biology
sequence analysis
0.312018
Integrating long-range connectivity information into de Bruijn graphs · Bioinform. 2018
Bioinformatics and computational biology › genomics › structural variation
structural variation detection
0.312018
Integrating long-range connectivity information into de Bruijn graphs · Bioinform. 2018
Bioinformatics and computational biology › genomics
variant calling
0.312018
Integrating long-range connectivity information into de Bruijn graphs · Bioinform. 2018
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly
de novo assembly
0.212013
High-throughput microbial population genomics using the Cortex variation assembler · Bioinform. 2013
Bioinformatics and computational biology › population genetics
genetic variation analysis
0.212013
High-throughput microbial population genomics using the Cortex variation assembler · Bioinform. 2013
Bioinformatics and computational biology › genomics › computational genomics
SNP detection
0.212013
High-throughput microbial population genomics using the Cortex variation assembler · Bioinform. 2013

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

string graph · 0.3de bruijn graph · 0.3genotyping · 0.2de novo assembly · 0.2
YearPublicationVenuePosition
2018 Integrating long-range connectivity information into de Bruijn graphs
abstract
Motivation: The de Bruijn graph is a simple and efficient data structure that is used in many areas of sequence analysis including genome assembly, read error correction and variant calling. The data structure has a single parameter k, is straightforward to implement and is tractable for large genomes with high sequencing depth. It also enables representation of multiple samples simultaneously to facilitate comparison. However, unlike the string graph, a de Bruijn graph does not retain long range information that is inherent in the read data. For this reason, applications that rely on de Bruijn graphs can produce sub-optimal results given their input data. Results: We present a novel assembly graph data structure: the Linked de Bruijn Graph (LdBG). Constructed by adding annotations on top of a de Bruijn graph, it stores long range connectivity information through the graph. We show that with error-free data it is possible to losslessly store and recover sequence from a Linked de Bruijn graph. With assembly simulations we demonstrate that the LdBG data structure outperforms both our de Bruijn graph and the String Graph Assembler (SGA). Finally we apply the LdBG to Klebsiella pneumoniae short read data to make large (12 kbp) variant calls, which we validate using PacBio sequencing data, and to characterize the genomic context of drug-resistance genes. Availability and implementation: Linked de Bruijn Graphs and associated algorithms are implemented as part of McCortex, which is available under the MIT license at https://github.com/mcveanlab/mccortex. Supplementary information: Supplementary data are available at Bioinformatics online.
Isaac Turner, Kiran V. Garimella, Zamin Iqbal, Gil McVean
Bioinform.1
2013 High-throughput microbial population genomics using the Cortex variation assembler
abstract
SUMMARY: We have developed a software package, Cortex, designed for the analysis of genetic variation by de novo assembly of multiple samples. This allows direct comparison of samples without using a reference genome as intermediate and incorporates discovery and genotyping of single-nucleotide polymorphisms, indels and larger events in a single framework. We introduce pipelines which simplify the analysis of microbial samples and increase discovery power; these also enable the construction of a graph of known sequence and variation in a species, against which new samples can be compared rapidly. We demonstrate the ease-of-use and power by reproducing the results of studies using both long and short reads. AVAILABILITY: http://cortexassembler.sourceforge.net (GPLv3 license). CONTACT: [email protected], [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Zamin Iqbal, Isaac Turner, Gil McVean
Bioinform.2