193 related articles for article (PubMed ID: 36333324)
1. VeChat: correcting errors in long reads using variation graphs.
Luo X; Kang X; Schönhuth A
Nat Commun; 2022 Nov; 13(1):6657. PubMed ID: 36333324
[TBL] [Abstract][Full Text] [Related]
2. Hybrid correction of highly noisy long reads using a variable-order de Bruijn graph.
Morisse P; Lecroq T; Lefebvre A
Bioinformatics; 2018 Dec; 34(24):4213-4222. PubMed ID: 29955770
[TBL] [Abstract][Full Text] [Related]
3. Scalable long read self-correction and assembly polishing with multiple sequence alignment.
Morisse P; Marchet C; Limasset A; Lecroq T; Lefebvre A
Sci Rep; 2021 Jan; 11(1):761. PubMed ID: 33436980
[TBL] [Abstract][Full Text] [Related]
4. Hybrid-hybrid correction of errors in long reads with HERO.
Kang X; Xu J; Luo X; Schönhuth A
Genome Biol; 2023 Dec; 24(1):275. PubMed ID: 38041098
[TBL] [Abstract][Full Text] [Related]
5. De novo diploid genome assembly using long noisy reads.
Nie F; Ni P; Huang N; Zhang J; Wang Z; Xiao C; Luo F; Wang J
Nat Commun; 2024 Apr; 15(1):2964. PubMed ID: 38580638
[TBL] [Abstract][Full Text] [Related]
6. ARAMIS: From systematic errors of NGS long reads to accurate assemblies.
Sacristán-Horcajada E; González-de la Fuente S; Peiró-Pastor R; Carrasco-Ramiro F; Amils R; Requena JM; Berenguer J; Aguado B
Brief Bioinform; 2021 Nov; 22(6):. PubMed ID: 34013348
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. Benchmarking of de novo assembly algorithms for Nanopore data reveals optimal performance of OLC approaches.
Cherukuri Y; Janga SC
BMC Genomics; 2016 Aug; 17 Suppl 7(Suppl 7):507. PubMed ID: 27556636
[TBL] [Abstract][Full Text] [Related]
9. Physical separation of haplotypes in dikaryons allows benchmarking of phasing accuracy in Nanopore and HiFi assemblies with Hi-C data.
Duan H; Jones AW; Hewitt T; Mackenzie A; Hu Y; Sharp A; Lewis D; Mago R; Upadhyaya NM; Rathjen JP; Stone EA; Schwessinger B; Figueroa M; Dodds PN; Periyannan S; Sperschneider J
Genome Biol; 2022 Mar; 23(1):84. PubMed ID: 35337367
[TBL] [Abstract][Full Text] [Related]
10. Chaining for accurate alignment of erroneous long reads to acyclic variation graphs.
Ma J; Cáceres M; Salmela L; Mäkinen V; Tomescu AI
Bioinformatics; 2023 Aug; 39(8):. PubMed ID: 37494467
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. Prowler: a novel trimming algorithm for Oxford Nanopore sequence data.
Lee S; Nguyen LT; Hayes BJ; Ross EM
Bioinformatics; 2021 Nov; 37(21):3936-3937. PubMed ID: 34473226
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. Characterization and simulation of metagenomic nanopore sequencing data with Meta-NanoSim.
Yang C; Lo T; Nip KM; Hafezqorani S; Warren RL; Birol I
Gigascience; 2023 Mar; 12():. PubMed ID: 36939007
[TBL] [Abstract][Full Text] [Related]
15. TideHunter: efficient and sensitive tandem repeat detection from noisy long-reads using seed-and-chain.
Gao Y; Liu B; Wang Y; Xing Y
Bioinformatics; 2019 Jul; 35(14):i200-i207. PubMed ID: 31510677
[TBL] [Abstract][Full Text] [Related]
16. DCHap: A Divide-and-Conquer Haplotype Phasing Algorithm for Third-Generation Sequences.
Li Y; Lin Y
IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(3):1277-1284. PubMed ID: 32750878
[TBL] [Abstract][Full Text] [Related]
17. Minimum error correction-based haplotype assembly: Considerations for long read data.
Majidian S; Kahaei MH; de Ridder D
PLoS One; 2020; 15(6):e0234470. PubMed ID: 32530974
[TBL] [Abstract][Full Text] [Related]
18. Improved assembly of noisy long reads by k-mer validation.
Carvalho AB; Dupim EG; Goldstein G
Genome Res; 2016 Dec; 26(12):1710-1720. PubMed ID: 27831497
[TBL] [Abstract][Full Text] [Related]
19. Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs.
Limasset A; Flot JF; Peterlongo P
Bioinformatics; 2020 Mar; 36(5):1374-1381. PubMed ID: 30785192
[TBL] [Abstract][Full Text] [Related]
20. 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]
[Next] [New Search]
