ArticlePhenomics (Cham, Switzerland)2021
The Ultrafast and Accurate Mapping Algorithm FANSe3: Mapping a Human Whole-Genome Sequencing Dataset Within 30 Minutes.
Article in Phenomics (Cham, Switzerland), 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 14 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
14 citing papers in PubMed.
- A cuproptosis-inducing covalent organic framework synergizes with oncolytic virus for tumor radiotherapy.Nature communications · 2026Article
- RecA Inhibitor Mitigates Bacterial Antibiotic Resistance.Microorganisms · 2025Article
- Genome-Wide Analysis of Polygalacturonase Gene Family Reveals Its Role in Strawberry Softening.Plants (Basel, Switzerland) · 2024Article
- TFAM is an autophagy receptor that limits inflammation by binding to cytoplasmic mitochondrial DNA.Nature cell biology · 2024Article
- Cohort profile: the China surgery and anesthesia cohort (CSAC).European journal of epidemiology · 2024Article
- A multi-omics dataset of human transcriptome and proteome stable reference.Scientific data · 2023Article
- Article
- Functional evolution of SARS-CoV-2 spike protein: Maintaining wide host spectrum and enhancing infectivity via surface charge of spike protein.Computational and structural biotechnology journal · 2023Article
- Efficient Detection of the Alternative Spliced Human Proteome Using Translatome Sequencing.Frontiers in molecular biosciences · 2022Article
- Identifying a 6-Gene Prognostic Signature for Lung Adenocarcinoma Based on Copy Number Variation and Gene Expression Data.Oxidative medicine and cellular longevity · 2022Article
- Towards an accurate and robust analysis pipeline for somatic mutation calling.Frontiers in genetics · 2022Article
- Comprehensive Analysis of the Oncogenic, Genomic Alteration, and Immunological Landscape of Cation-Chloride Cotransporters in Pan-Cancer.Frontiers in oncology · 2022Article
- mFrontiers in oncology · 2021Article
- Development and Application of a Fast Method to Acquire the Accurate Whole-Genome Sequences of Human Adenoviruses.Frontiers in microbiology · 2021Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Aligning billions of reads generated by the next-generation sequencing (NGS) to reference sequences, termed "mapping", is the time-consuming and computationally-intensive process in most NGS applications. A Fast, accurate and robust mapping algorithm is highly needed. Therefore, we developed the FANSe3 mapping algorithm, which can map a 30 × human whole-genome sequencing (WGS) dataset within 30 min, a 50 × human whole exome sequencing (WES) dataset within 30 s, and a typical mRNA-seq dataset within seconds in a single-server node without the need for any hardware acceleration feature. Like its predecessor FANSe2, the error rate of FANSe3 can be kept as low as 10
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.