180 related articles for article (PubMed ID: 35731219)
1. Figbird: a probabilistic method for filling gaps in genome assemblies.
Tarafder S; Islam M; Shatabda S; Rahman A
Bioinformatics; 2022 Aug; 38(15):3717-3724. PubMed ID: 35731219
[TBL] [Abstract][Full Text] [Related]
2. GAPPadder: a sensitive approach for closing gaps on draft genomes with short sequence reads.
Chu C; Li X; Wu Y
BMC Genomics; 2019 Jun; 20(Suppl 5):426. PubMed ID: 31167639
[TBL] [Abstract][Full Text] [Related]
3. ReMILO: reference assisted misassembly detection algorithm using short and long reads.
Bao E; Song C; Lan L
Bioinformatics; 2018 Jan; 34(1):24-32. PubMed ID: 28961789
[TBL] [Abstract][Full Text] [Related]
4. Apollo: a sequencing-technology-independent, scalable and accurate assembly polishing algorithm.
Firtina C; Kim JS; Alser M; Senol Cali D; Cicek AE; Alkan C; Mutlu O
Bioinformatics; 2020 Jun; 36(12):3669-3679. PubMed ID: 32167530
[TBL] [Abstract][Full Text] [Related]
5. GMcloser: closing gaps in assemblies accurately with a likelihood-based selection of contig or long-read alignments.
Kosugi S; Hirakawa H; Tabata S
Bioinformatics; 2015 Dec; 31(23):3733-41. PubMed ID: 26261222
[TBL] [Abstract][Full Text] [Related]
6. GRASS: a generic algorithm for scaffolding next-generation sequencing assemblies.
Gritsenko AA; Nijkamp JF; Reinders MJ; de Ridder D
Bioinformatics; 2012 Jun; 28(11):1429-37. PubMed ID: 22492642
[TBL] [Abstract][Full Text] [Related]
7. RFfiller: a robust and fast statistical algorithm for gap filling in draft genomes.
Midekso FD; Yi G
PeerJ; 2022; 10():e14186. PubMed ID: 36262414
[TBL] [Abstract][Full Text] [Related]
8. ARCS: scaffolding genome drafts with linked reads.
Yeo S; Coombe L; Warren RL; Chu J; Birol I
Bioinformatics; 2018 Mar; 34(5):725-731. PubMed ID: 29069293
[TBL] [Abstract][Full Text] [Related]
9. SASpector: analysis of missing genomic regions in draft genomes of prokaryotes.
Lood C; Correa Rojo A; Sinar D; Verkinderen E; Lavigne R; Noort VV
Bioinformatics; 2022 May; 38(10):2920-2921. PubMed ID: 35561201
[TBL] [Abstract][Full Text] [Related]
10. Improving the sensitivity of long read overlap detection using grouped short k-mer matches.
Du N; Chen J; Sun Y
BMC Genomics; 2019 Apr; 20(Suppl 2):190. PubMed ID: 30967123
[TBL] [Abstract][Full Text] [Related]
11. Compression of genomic sequencing reads via hash-based reordering: algorithm and analysis.
Chandak S; Tatwawadi K; Weissman T
Bioinformatics; 2018 Feb; 34(4):558-567. PubMed ID: 29444237
[TBL] [Abstract][Full Text] [Related]
12. A spectral algorithm for fast de novo layout of uncorrected long nanopore reads.
Recanati A; Brüls T; d'Aspremont A
Bioinformatics; 2017 Oct; 33(20):3188-3194. PubMed ID: 28605450
[TBL] [Abstract][Full Text] [Related]
13. Unicycler: Resolving bacterial genome assemblies from short and long sequencing reads.
Wick RR; Judd LM; Gorrie CL; Holt KE
PLoS Comput Biol; 2017 Jun; 13(6):e1005595. PubMed ID: 28594827
[TBL] [Abstract][Full Text] [Related]
14. NextPolish: a fast and efficient genome polishing tool for long-read assembly.
Hu J; Fan J; Sun Z; Liu S
Bioinformatics; 2020 Apr; 36(7):2253-2255. PubMed ID: 31778144
[TBL] [Abstract][Full Text] [Related]
15. Coverage-preserving sparsification of overlap graphs for long-read assembly.
Jain C
Bioinformatics; 2023 Mar; 39(3):. PubMed ID: 36892439
[TBL] [Abstract][Full Text] [Related]
16. MTG-Link: leveraging barcode information from linked-reads to assemble specific loci.
Guichard A; Legeai F; Tagu D; Lemaitre C
BMC Bioinformatics; 2023 Jul; 24(1):284. PubMed ID: 37452278
[TBL] [Abstract][Full Text] [Related]
17. GAVISUNK: genome assembly validation via inter-SUNK distances in Oxford Nanopore reads.
Dishuck PC; Rozanski AN; Logsdon GA; Porubsky D; Eichler EE
Bioinformatics; 2023 Jan; 39(1):. PubMed ID: 36321867
[TBL] [Abstract][Full Text] [Related]
18. TGS-GapCloser: A fast and accurate gap closer for large genomes with low coverage of error-prone long reads.
Xu M; Guo L; Gu S; Wang O; Zhang R; Peters BA; Fan G; Liu X; Xu X; Deng L; Zhang Y
Gigascience; 2020 Sep; 9(9):. PubMed ID: 32893860
[TBL] [Abstract][Full Text] [Related]
19. An accurate algorithm for the detection of DNA fragments from dilution pool sequencing experiments.
Bansal V
Bioinformatics; 2018 Jan; 34(1):155-162. PubMed ID: 29036419
[TBL] [Abstract][Full Text] [Related]
20. BFC: correcting Illumina sequencing errors.
Li H
Bioinformatics; 2015 Sep; 31(17):2885-7. PubMed ID: 25953801
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
