These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

221 related articles for article (PubMed ID: 25344498)

  • 1. Using 2k + 2 bubble searches to find single nucleotide polymorphisms in k-mer graphs.
    Younsi R; MacLean D
    Bioinformatics; 2015 Mar; 31(5):642-6. PubMed ID: 25344498
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Integrating long-range connectivity information into de Bruijn graphs.
    Turner I; Garimella KV; Iqbal Z; McVean G
    Bioinformatics; 2018 Aug; 34(15):2556-2565. PubMed ID: 29554215
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Metagenome SNP calling via read-colored de Bruijn graphs.
    Alipanahi B; Muggli MD; Jundi M; Noyes NR; Boucher C
    Bioinformatics; 2021 Apr; 36(22-23):5275-5281. PubMed ID: 32049324
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Fast and SNP-aware short read alignment with SALT.
    Quan W; Liu B; Wang Y
    BMC Bioinformatics; 2021 Aug; 22(Suppl 9):172. PubMed ID: 34433415
    [TBL] [Abstract][Full Text] [Related]  

  • 5. BubbleGun: enumerating bubbles and superbubbles in genome graphs.
    Dabbaghie F; Ebler J; Marschall T
    Bioinformatics; 2022 Sep; 38(17):4217-4219. PubMed ID: 35799353
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Variable-order reference-free variant discovery with the Burrows-Wheeler Transform.
    Prezza N; Pisanti N; Sciortino M; Rosone G
    BMC Bioinformatics; 2020 Sep; 21(Suppl 8):260. PubMed ID: 32938358
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Fast and accurate genomic analyses using genome graphs.
    Rakocevic G; Semenyuk V; Lee WP; Spencer J; Browning J; Johnson IJ; Arsenijevic V; Nadj J; Ghose K; Suciu MC; Ji SG; Demir G; Li L; Toptaş BÇ; Dolgoborodov A; Pollex B; Spulber I; Glotova I; Kómár P; Stachyra AL; Li Y; Popovic M; Källberg M; Jain A; Kural D
    Nat Genet; 2019 Feb; 51(2):354-362. PubMed ID: 30643257
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Aligning optical maps to de Bruijn graphs.
    Mukherjee K; Alipanahi B; Kahveci T; Salmela L; Boucher C
    Bioinformatics; 2019 Sep; 35(18):3250-3256. PubMed ID: 30698651
    [TBL] [Abstract][Full Text] [Related]  

  • 9. BrownieAligner: accurate alignment of Illumina sequencing data to de Bruijn graphs.
    Heydari M; Miclotte G; Van de Peer Y; Fostier J
    BMC Bioinformatics; 2018 Sep; 19(1):311. PubMed ID: 30180801
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A space and time-efficient index for the compacted colored de Bruijn graph.
    Almodaresi F; Sarkar H; Srivastava A; Patro R
    Bioinformatics; 2018 Jul; 34(13):i169-i177. PubMed ID: 29949982
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Demonstrating the utility of flexible sequence queries against indexed short reads with FlexTyper.
    Richmond PA; Kaye AM; Kounkou GJ; Av-Shalom TV; Wasserman WW
    PLoS Comput Biol; 2021 Mar; 17(3):e1008815. PubMed ID: 33750951
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Accurate determination of node and arc multiplicities in de bruijn graphs using conditional random fields.
    Steyaert A; Audenaert P; Fostier J
    BMC Bioinformatics; 2020 Sep; 21(1):402. PubMed ID: 32928110
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Unbiased pangenome graphs.
    Garrison E; Guarracino A
    Bioinformatics; 2023 Jan; 39(1):. PubMed ID: 36448683
    [TBL] [Abstract][Full Text] [Related]  

  • 14. 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]  

  • 15. Minimizer-space de Bruijn graphs: Whole-genome assembly of long reads in minutes on a personal computer.
    Ekim B; Berger B; Chikhi R
    Cell Syst; 2021 Oct; 12(10):958-968.e6. PubMed ID: 34525345
    [TBL] [Abstract][Full Text] [Related]  

  • 16. 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]  

  • 17. ntCard: a streaming algorithm for cardinality estimation in genomics data.
    Mohamadi H; Khan H; Birol I
    Bioinformatics; 2017 May; 33(9):1324-1330. PubMed ID: 28453674
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Cuttlefish: fast, parallel and low-memory compaction of de Bruijn graphs from large-scale genome collections.
    Khan J; Patro R
    Bioinformatics; 2021 Jul; 37(Suppl_1):i177-i186. PubMed ID: 34252958
    [TBL] [Abstract][Full Text] [Related]  

  • 19. StLiter: A Novel Algorithm to Iteratively Build the Compacted de Bruijn Graph From Many Complete Genomes.
    Yu C; Mao K; Zhao Y; Chang C; Wang G
    IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(4):2471-2483. PubMed ID: 33630738
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Mapping-free variant calling using haplotype reconstruction from k-mer frequencies.
    Audano PA; Ravishankar S; Vannberg FO
    Bioinformatics; 2018 May; 34(10):1659-1665. PubMed ID: 29186321
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 12.