MétaCan
Menu
Back to cohort
Record W2132548846 · doi:10.1186/1471-2105-13-31

PANDAseq: paired-end assembler for illumina sequences

2012· article· en· W2132548846 on OpenAlexafffund
Andre Masella, Andrea K. Bartram, Jakub Truszkowski, Daniel G. Brown, Josh D. Neufeld

Bibliographic record

VenueBMC Bioinformatics · 2012
Typearticle
Languageen
FieldEnvironmental Science
TopicMicrobial Community Ecology and Physiology
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of CanadaGovernment of Ontario
KeywordsAmpliconComputer scienceSequence (biology)Error detection and correctionk-merAmplicon sequencingSequence assemblyComputational biologyDNA sequencingBiologyGeneticsAlgorithmDNA16S ribosomal RNAPolymerase chain reactionGene

Abstract

fetched live from OpenAlex

BACKGROUND: Illumina paired-end reads are used to analyse microbial communities by targeting amplicons of the 16S rRNA gene. Publicly available tools are needed to assemble overlapping paired-end reads while correcting mismatches and uncalled bases; many errors could be corrected to obtain higher sequence yields using quality information. RESULTS: PANDAseq assembles paired-end reads rapidly and with the correction of most errors. Uncertain error corrections come from reads with many low-quality bases identified by upstream processing. Benchmarks were done using real error masks on simulated data, a pure source template, and a pooled template of genomic DNA from known organisms. PANDAseq assembled reads more rapidly and with reduced error incorporation compared to alternative methods. CONCLUSIONS: PANDAseq rapidly assembles sequences and scales to billions of paired-end reads. Assembly of control libraries showed a 4-50% increase in the number of assembled sequences over naïve assembly with negligible loss of "good" sequence.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Software · Consensus signal: none
Teacher disagreement score0.025
Threshold uncertainty score0.082

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.003
Meta-epidemiology (narrow)0.0030.002
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0020.001
Science and technology studies0.0020.001
Scholarly communication0.0020.001
Open science0.0030.002
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0250.025

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.039
GPT teacher head0.264
Teacher spread0.224 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreSoftware

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2,221
Published2012
Admission routes2
Has abstractyes

Explore more

Same venueBMC BioinformaticsSame topicMicrobial Community Ecology and PhysiologyFrench-language works237,207